The On-Line Encyclopedia of Bongard Problems

Search: +meta:BP867

Displaying 11-20 of 84 results found.

( prev | next ) page 1 2 3 4 5 6 7 8 9

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

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, traditional, fixedgrid, preciseworld`
	CONCEPT	`all (info \| search),` `chess-like (info \| search),` `imagined_motion (info \| search),` `motion (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP381

Adding the top two waves yields the bottom wave vs. not so.

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

	COMMENTS	`This problem is about wave interference.`
	CROSSREFS	`Adjacent-numbered pages: BP376 BP377 BP378 BP379 BP380 * BP382 BP383 BP384 BP385 BP386`
	KEYWORD	`nice, notso, math, orderedtriplet, traditional`
	CONCEPT	`addition (info \| search),` `wave (info \| search),` `2_inputs_1_output (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP385

Nets of cubes vs. not nets of cubes.

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

	CROSSREFS	`Adjacent-numbered pages: BP380 BP381 BP382 BP383 BP384 * BP386 BP387 BP388 BP389 BP390`
	KEYWORD	`nice, notso, left-finite, traditional`
	CONCEPT	`3d_net (info \| search)`
	WORLD	`square_outlines_sharing_edges [smaller \| same \| bigger] zoom in left (cube_net)`
	AUTHOR	`Jago Collins`

BP390

Each graph vertex is uniquely defined by its connections (the graph does not admit nontrivial automorphisms) vs. the graph admits nontrivial automorphisms.

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

	CROSSREFS	`Adjacent-numbered pages: BP385 BP386 BP387 BP388 BP389 * BP391 BP392 BP393 BP394 BP395`
	KEYWORD	`precise, allsorted, notso, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `self-reference (info \| search),` `topological_transformation (info \| search),` `imagined_shape (info \| search),` `imagined_entity (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP538

Shown is a box of this Bongard Problem (BP538) vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP533 BP534 BP535 BP536 BP537 * BP539 BP540 BP541 BP542 BP543`
	KEYWORD	`less, notso, left-finite, finished, invalid, experimental, funny`
	CONCEPT	`recursion (info \| search),` `self-reference (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP545

Solution for this problem (BP545) in English text vs. not.

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

	COMMENTS	`This Problem admits multiple solutions besides "Solution for this problem in English text vs. not so," some of which are listed as the left examples. Some do not depend on the English language, so this Problem is technically "solvable" without the relevant cultural information.`
	CROSSREFS	`Adjacent-numbered pages: BP540 BP541 BP542 BP543 BP544 * BP546 BP547 BP548 BP549 BP550`
	KEYWORD	`less, notso, culture, finished, invalid, experimental, funny`
	CONCEPT	`recursion (info \| search),` `self-reference (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP559

Cross section of a cube vs. not cross section of a cube

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

	COMMENTS	`All examples are solid black shapes.` `This problem is absurdly hard. It makes a good extreme example. - Aaron David Fairbanks, Nov 23 2020`
	CROSSREFS	`Adjacent-numbered pages: BP554 BP555 BP556 BP557 BP558 * BP560 BP561 BP562 BP563 BP564`
	KEYWORD	`hard, precise, allsorted, notso, stretch, challenge, left-narrow, perfect`
	CONCEPT	`cube (info \| search),` `cross_section (info \| search)`
	WORLD	`fill_shape [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP569

Triangular number of dots vs. non-triangular number of dots

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

	COMMENTS	`All examples in this Problem are groups of black dots.` `The nth triangular number is the sum over the natural numbers from 1 to n, where n > 0. Note: 0 is the 0th triangular number. The first few triangular numbers are 0, 1, 3 (= 1+2) and 6 (= 1+2+3)`
	CROSSREFS	`Adjacent-numbered pages: BP564 BP565 BP566 BP567 BP568 * BP570 BP571 BP572 BP573 BP574`
	KEYWORD	`nice, precise, allsorted, notso, number, math, left-narrow, left-null, help, preciseworld`
	WORLD	`dots [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP576

Vertices may be partitioned into two sets such that no two vertices in the same set are connected versus not so.

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

	COMMENTS	`Left examples are called "bipartite graphs."`
	CROSSREFS	`Adjacent-numbered pages: BP571 BP572 BP573 BP574 BP575 * BP577 BP578 BP579 BP580 BP581`
	KEYWORD	`precise, allsorted, notso, math, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search)`
	WORLD	`graph [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP812

Aesthetically pleasing vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP807 BP808 BP809 BP810 BP811 * BP813 BP814 BP815 BP816 BP817`
	KEYWORD	`easy, fuzzy, abstract, notso, stretch, anticomputer, subjective, invalid, experimental, funny, dithering`
	AUTHOR	`Aaron David Fairbanks`

( prev | next ) page 1 2 3 4 5 6 7 8 9

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