The On-Line Encyclopedia of Bongard Problems

Search: keyword:allsorted

Displaying 111-113 of 113 results found.

( prev ) page 1 2 3 4 5 6 7 8 9 10 11 12

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

Circled points are all possible vertices a regular hexagon 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)

CROSSREFS

See BP1279 for version with squares on a square grid.

Adjacent-numbered pages: BP1275 BP1276 BP1277 BP1278 BP1279 * BP1281 BP1282 BP1283 BP1284 BP1285

KEYWORD

hard, precise, allsorted, unwordable, hardsort, left-finite, right-finite, preciseworld

AUTHOR

Leo Crabbe

BP1282

If two players take turns moving moving the black circles with the intention of capturing their opponent's piece, one can always "checkmate" the other vs. the game results in a draw if the players play optimally.

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

	COMMENTS	`Players can only move their piece to a node connected to their current position. A win is secured by moving to a node your opponent is occupying.` `Which player that can force a win in left-sorted examples can change depending on who moves first.`
	CROSSREFS	`See BP1284 for an animated Problem about the same game.` `Adjacent-numbered pages: BP1277 BP1278 BP1279 BP1280 BP1281 * BP1283 BP1284 BP1285 BP1286 BP1287`
	KEYWORD	`allsorted, unwordable, notso, teach`
	CONCEPT	`capture_game (info \| search)`
	AUTHOR	`Leo Crabbe`

BP1294

No sequence starts with another vs. some sequence starts with another.

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

	REFERENCE	`https://en.wikipedia.org/wiki/Prefix_code`
	CROSSREFS	`Adjacent-numbered pages: BP1289 BP1290 BP1291 BP1292 BP1293 * BP1295 BP1296`
	KEYWORD	`allsorted, notso, preciseworld, dithering, collection`
	AUTHOR	`Leo Crabbe`

( prev ) page 1 2 3 4 5 6 7 8 9 10 11 12

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