The On-Line Encyclopedia of Bongard Problems

Search: subworld:everything

Displaying 1191-1198 of 1198 results found.

( prev ) page 1 ... 110 111 112 113 114 115 116 117 118 119 120

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

If two nodes are linked, they are each linked to a different number of nodes vs. not so.

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

	REFERENCE	`https://en.wikipedia.org/wiki/Highly_irregular_graph`
	CROSSREFS	`Adjacent-numbered pages: BP1278 BP1279 BP1280 BP1281 BP1282 * BP1284 BP1285 BP1286 BP1287 BP1288`
	CONCEPT	`graph (info \| search)`
	AUTHOR	`Leo Crabbe`

Both players playing "capture game" optimally vs. one or both players make mistakes.

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

	COMMENTS	`In the depicted "capture game", the objective is to capture your opponent's piece by moving to a node they are occupying. Players take turns moving their pieces. You can only move to a node that is linked to yours. Optimal play can either lead to a win-lose state or a draw state.` `A frame where only one black disc is visible signifies that a player has taken the other's piece, winning the game.`
	CROSSREFS	`Adjacent-numbered pages: BP1279 BP1280 BP1281 BP1282 BP1283 * BP1285 BP1286 BP1287 BP1288 BP1289`
	KEYWORD	`teach, animated`
	CONCEPT	`capture_game (info \| search)`
	AUTHOR	`Leo Crabbe`

First to move wins vs. first to move loses.

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

	COMMENTS	`In the depicted "capture game", the objective is to capture your opponent's piece by moving to a node they are occupying. Players take turns moving their pieces. You can only move to a node that is linked to yours. All examples are "boards" where either player can force a win, depending on who moves first.` `Players are assumed to be making optimal choices.`
	CROSSREFS	`Adjacent-numbered pages: BP1280 BP1281 BP1282 BP1283 BP1284 * BP1286 BP1287 BP1288 BP1289 BP1290`
	KEYWORD	`stub`
	CONCEPT	`capture_game (info \| search)`
	AUTHOR	`Leo Crabbe`

One frame rate vs. another.

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

	COMMENTS	`In particular, 40fps vs. 20fps.`
	CROSSREFS	`Adjacent-numbered pages: BP1281 BP1282 BP1283 BP1284 BP1285 * BP1287 BP1288 BP1289 BP1290 BP1291`
	KEYWORD	`stub, precise, arbitrary, antihuman, animated, contributepairs, right-couldbe, preciseworld`
	AUTHOR	`Leo Crabbe`

Bongard Problem with solution relating to concept: chess-like capture game vs. Bongard Problem unrelated to this concept.

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

	CROSSREFS	`Adjacent-numbered pages: BP1282 BP1283 BP1284 BP1285 BP1286 * BP1288 BP1289 BP1290 BP1291`
	KEYWORD	`meta (see left/right), metaconcept`
	CONCEPT	`This MBP is about BPs that feature concept: "capture_game"`
	WORLD	`bp [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

Animations vs. static images.

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

	CROSSREFS	`Adjacent-numbered pages: BP1283 BP1284 BP1285 BP1286 BP1287 * BP1289 BP1290 BP1291`
	KEYWORD	`world, animated`
	AUTHOR	`Leo Crabbe`

Red and its derivative hues vs. not

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

	COMMENTS	`Solution worded differently:` `Colors that use the primary color red to make, vs colors that don’t/cannot` `Reds and its secondary and tertiary relations vs. not` `Red and its pigment relatives vs. not` `Comment from the author (a.k.a. Morgan Kidd):` `Thank you Sally D. for introducing me to bongards!`
	CROSSREFS	`Adjacent-numbered pages: BP1285 BP1286 BP1287 BP1288 BP1289 * BP1291`
	KEYWORD	`precise, notso, color`
	AUTHOR	`Morgan`

Black points are the set of vertices that are some shortest-distance away from some white vertex vs. not so.

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

	COMMENTS	`Left hand examples can be thought of as "graph circles".`
	CROSSREFS	`https://en.wikipedia.org/wiki/Level_structure` `Adjacent-numbered pages: BP1286 BP1287 BP1288 BP1289 BP1290 *`
	KEYWORD	`precise, unwordable, notso, left-narrow`
	CONCEPT	`graph (info \| search)`
	AUTHOR	`Leo Crabbe`

( prev ) page 1 ... 110 111 112 113 114 115 116 117 118 119 120

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