The On-Line Encyclopedia of Bongard Problems

Search: all:new

Displaying 91-100 of 799 results found.

( prev | next ) page 1 ... 6 7 8 9 10 11 12 13 14 ... 80

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

Image contains the exact arrangement of pixels that form the "S" creature depicted in EX9532 vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP1156 BP1157 BP1158 BP1159 BP1160 * BP1162 BP1163 BP1164 BP1165 BP1166`
	KEYWORD	`unwordable, notso, arbitrary, handed, leftright, updown, stretch, blackwhite, creativeexamples, right-null, perfect, pixelperfect, help`
	AUTHOR	`Leo Crabbe`

BP1157

The order in which the objects in the top half are combined to make the object in the lower half matters vs. not so.

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

	COMMENTS	`Operations depicted in right-sorted examples are called "commutative".` `"Order matters" here means that if the objects in the top half were to switch places, the output would look different.`
	REFERENCE	`https://en.wikipedia.org/wiki/Commutative_property`
	CROSSREFS	`Adjacent-numbered pages: BP1152 BP1153 BP1154 BP1155 BP1156 * BP1158 BP1159 BP1160 BP1161 BP1162`
	KEYWORD	`nice, abstract, unwordable, notso, structure, rules, miniworlds`
	CONCEPT	`function (info \| search)`
	AUTHOR	`Leo Crabbe`

BP1156

Centred vs. not.

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

	CROSSREFS	`Adjacent-numbered pages: BP1151 BP1152 BP1153 BP1154 BP1155 * BP1157 BP1158 BP1159 BP1160 BP1161`
	KEYWORD	`precise, minimal, boundingbox, left-finite, left-full, perfect, pixelperfect, finishedexamples, preciseworld, absoluteposition`
	CONCEPT	`center (info \| search)`
	AUTHOR	`Leo Crabbe`

BP1155

Shapes are sorted according to a simple rule that uniquely determines where everything goes vs. shapes are sorted according to some other rule (or lack thereof).

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

	CROSSREFS	`Adjacent-numbered pages: BP1150 BP1151 BP1152 BP1153 BP1154 * BP1156 BP1157 BP1158 BP1159 BP1160`
	KEYWORD	`abstract, unwordable, creativeexamples, right-unknowable, traditional, finishedexamples, rules`
	AUTHOR	`Leo Crabbe`

BP1153

Valid multi-sided Bongard Problems vs. invalid multi-sided Bongard Problems.

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

	COMMENTS	`This is a generalisation of Bongard Problems that allows them to have any number of sides. There is a sense in which this problem is about valid vs. invalid ways of partitioning a set of examples into equivalence classes.`
	CROSSREFS	`https://en.wikipedia.org/wiki/Equivalence_class` `Adjacent-numbered pages: BP1148 BP1149 BP1150 BP1151 BP1152 * BP1154 BP1155 BP1156 BP1157 BP1158`
	KEYWORD	`abstract, teach, meta (see left/right), miniproblems, infodense, structure, rules, miniworlds`
	WORLD	`zoom in left`
	AUTHOR	`Leo Crabbe`

BP1151

Section of the image is a Bongard Problem vs. no section of the image is a Bongard Problem.

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

	CROSSREFS	`Adjacent-numbered pages: BP1146 BP1147 BP1148 BP1149 BP1150 * BP1152 BP1153 BP1154 BP1155 BP1156`
	KEYWORD	`right-null`
	AUTHOR	`Leo Crabbe`

BP1149

Number in the Nth box (from the left) is how many numbers appear N times vs. not so.

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

	CROSSREFS	`Inspired by BP1148.` `Adjacent-numbered pages: BP1144 BP1145 BP1146 BP1147 BP1148 * BP1150 BP1151 BP1152 BP1153 BP1154`
	KEYWORD	`nice, precise, unwordable, notso, handed, leftright, left-narrow, sequence, preciseworld, left-listable, right-listable`
	CONCEPT	`self-reference (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP1148

Number of dots in the Nth box (from the left) is how many times the number (N - 1) appears in the whole diagram vs. not so.

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

	COMMENTS	`Left-sorted examples are sometimes called autobiographical or self-descriptive numbers.`
	REFERENCE	`https://oeis.org/A349595` `https://en.wikipedia.org/wiki/Self-descriptive_number`
	CROSSREFS	`See BP1147 for a similar idea.` `BP1149 was inspired by this.` `Adjacent-numbered pages: BP1143 BP1144 BP1145 BP1146 BP1147 * BP1149 BP1150 BP1151 BP1152 BP1153`
	KEYWORD	`nice, precise, unwordable, notso, handed, leftright, left-narrow, sequence, preciseworld, left-listable, right-listable`
	CONCEPT	`self-reference (info \| search)`
	AUTHOR	`Leo Crabbe`

BP1147

Columns of the table could be respectively labeled "Number" and "Number of times number appears in this table" vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP1142 BP1143 BP1144 BP1145 BP1146 * BP1148 BP1149 BP1150 BP1151 BP1152`
	KEYWORD	`nice, precise, notso, handed, leftright, left-narrow, grid, preciseworld, left-listable, right-listable`
	CONCEPT	`self-reference (info \| search)`
	AUTHOR	`Leo Crabbe`

BP1146

Same number of dots in top row as in leftmost column vs not so.

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

	COMMENTS	`This is a difficult-to-read attempt at making a Bongard Problem about perfect numbers. Grouping columns together to make rectangular arrays, each maximal (most dots possible) rectangular array of a particular height in any given example has the same number of dots in it (a perfect number, in left-sorted cases), and the dot-width of each array represents a particular divisor of that number.` `It is not currently known whether there are a finite amount of examples that would be sorted left.` `Every example in this Bongard Problem corresponds to a distinct natural number. There is not a way of representing the number 1 using the rules of construction for examples in this problem (if the problem were simply "Perfect number of dots vs. other number of dots", the example with 1 dot would be sorted right).`
	REFERENCE	`https://en.wikipedia.org/wiki/Perfect_number`
	CROSSREFS	`Adjacent-numbered pages: BP1141 BP1142 BP1143 BP1144 BP1145 * BP1147 BP1148 BP1149 BP1150 BP1151`
	KEYWORD	`overriddensolution, left-listable, right-listable`
	AUTHOR	`Leo Crabbe`

( prev | next ) page 1 ... 6 7 8 9 10 11 12 13 14 ... 80

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