The On-Line Encyclopedia of Bongard Problems

Search: +meta:BP1176

Displaying 11-14 of 14 results found.

( prev ) page 1 2

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

BP1257

The rule is about squares having a certain relationship with their neighbors vs. it is not.

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

	COMMENTS	`"Local vs. global."` `For clarity, rules involving diagonal neighbors or squares more than one step away are never used.` `The similar solution "Each square can be deduced from its neighbors vs. not so" does not quite work; for example EX8114 would then not fit left. See also BP1258 ("Each square can be deduced from the rest vs. not so").`
	CROSSREFS	`Adjacent-numbered pages: BP1252 BP1253 BP1254 BP1255 BP1256 * BP1258 BP1259 BP1260 BP1261 BP1262`
	KEYWORD	`structure, rules, grid, miniworlds`
	CONCEPT	`local_global (info \| search)`
	WORLD	`grid_of_images_with_rule [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP1258

It is possible to deduce the contents of any square from the rest vs. it is not.

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

	CROSSREFS	`BP979 is very similar: whether a particular square can be deduced from the rest.` `Adjacent-numbered pages: BP1253 BP1254 BP1255 BP1256 BP1257 * BP1259 BP1260 BP1261 BP1262 BP1263`
	KEYWORD	`notso, rules, grid, miniworlds`
	CONCEPT	`convey_enough_information (info \| search),` `choice (info \| search)`
	WORLD	`grid_of_images_with_rule [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP1259

Rule is the same for rows as it is for columns vs. not

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

	CROSSREFS	`All examples on the left are chosen so that rotating or flipping the grid in any way would result in a grid satisfying the same rule.` `Adjacent-numbered pages: BP1254 BP1255 BP1256 BP1257 BP1258 * BP1260 BP1261 BP1262 BP1263 BP1264`
	KEYWORD	`notso, rules, grid, miniworlds`
	WORLD	`grid_of_images_with_rule [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP1278

There is a way of dividing the grid into (more than one) equal-sized blocks such that no block appears more than once vs. there exists no such way of dividing the grid.