The On-Line Encyclopedia of Bongard Problems

Search: keyword:fixedgrid

Displaying 1-6 of 6 results found.

page 1

Sort: id Format: long Filter: (all | no meta | meta) Mode: (words | no words)

BP303

Three objects are identical, the fourth differs vs. not so.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP298 BP299 BP300 BP301 BP302 * BP304 BP305 BP306 BP307 BP308`
	KEYWORD	`noisy, traditional, fixedgrid`
	CONCEPT	`same_shape (info \| search),` `same (info \| search)`
	AUTHOR	`"Lewis"`

BP376

A "chess piece" that moves as shown may reach every square vs. not so.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP371 BP372 BP373 BP374 BP375 * BP377 BP378 BP379 BP380 BP381`
	KEYWORD	`precise, allsorted, notso, left-finite, right-finite, fixedgrid, preciseworld`
	CONCEPT	`all (info \| search),` `chess-like (info \| search),` `imagined_motion (info \| search),` `motion (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP1049

3 in a row vs. not

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP1044 BP1045 BP1046 BP1047 BP1048 * BP1050 BP1051 BP1052 BP1053 BP1054`
	KEYWORD	`teach, creativeexamples, left-narrow, right-narrow, contributepairs, fixedgrid, miniworlds`
	CONCEPT	`three (info \| search)`
	AUTHOR	`Jago Collins`

BP1223

Center square is black vs. center square is white.

(edit; present; nest [left/right]; search; history)

	COMMENTS	`All examples are a three by three grid of black or white squares.`
	CROSSREFS	`Adjacent-numbered pages: BP1218 BP1219 BP1220 BP1221 BP1222 * BP1224 BP1225 BP1226 BP1227 BP1228`
	KEYWORD	`stub, left-finite, right-finite, traditional, finishedexamples, fixedgrid, preciseworld`
	CONCEPT	`outlined_filled (info \| search),` `center (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP1279

Circled points are all possible vertices a square with a particular side length can take, provided that each of its corners lie on a grid point vs. not so.

(edit; present; nest [left/right]; search; history)

	COMMENTS	`Rotation of the square is allowed.`
	CROSSREFS	`See BP1280 for version with hexagons on a hexagonal grid.` `Adjacent-numbered pages: BP1274 BP1275 BP1276 BP1277 BP1278 * BP1280 BP1281 BP1282 BP1283 BP1284`
	KEYWORD	`hard, precise, allsorted, unwordable, hardsort, left-finite, right-finite, left-full, fixedgrid, preciseworld`
	CONCEPT	`square (info \| search)`
	AUTHOR	`Leo Crabbe`

BP1292

Requires an even number of paths to cover all black squares vs requires an odd number of paths to cover all black squares

(edit; present; nest [left/right]; search; history)

	COMMENTS	`A path is formally defined as a sequence of black squares such that no two squares are the same and every pair of consecutive black squares are orthogonally adjacent to each other.` `Every grid on the left requires a minimum of an even number of paths such that every black square is a part of exactly one path, while every grid on the right requires a minimum of an odd number of paths to do so.`
	CROSSREFS	`Adjacent-numbered pages: BP1287 BP1288 BP1289 BP1290 BP1291 * BP1293 BP1294`
	EXAMPLE	`A grid with all whites fits on the left because it does not contain black squares, hence requiring 0 paths, an even number.` `A grid with all blacks requires 1 path to go through all black squares (such as a zigzag through every row), an odd number.` `The checkerboard grid on the left contains 12 black squares that cannot be joined with a path, hence it requires 12 paths, an even number.`
	KEYWORD	`nice, blackwhite, fixedgrid, left-listable, right-listable`
	CONCEPT	`path (info \| search)`
	AUTHOR	`Matt Nguyen`

page 1

		Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)