The On-Line Encyclopedia of Bongard Problems

Search: keyword:hardsort

Displaying 11-15 of 15 results found.

( prev ) page 1 2

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

Can be cut into tiles forming a checkerboard pattern vs. not so.

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

	COMMENTS	`All examples in this Problem are grids consisting of two objects.`
	CROSSREFS	`Adjacent-numbered pages: BP1118 BP1119 BP1120 BP1121 BP1122 * BP1124 BP1125 BP1126 BP1127 BP1128`
	EXAMPLE	`EX9124 shows a 9 square by 9 square grid. Take each tile to be 3 squares by 3 squares; there is a 3 tile by 3 tile checkerboard pattern. (One of these tiles is itself a checkerboard pattern; the other is all black squares.)`
	KEYWORD	`hard, nice, precise, allsorted, hardsort, grid, miniworlds`
	AUTHOR	`Jago Collins`

BP1132

Circle that passes through points is contained within bounding box vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP1127 BP1128 BP1129 BP1130 BP1131 * BP1133 BP1134 BP1135 BP1136 BP1137`
	KEYWORD	`precise, allsorted, boundingbox, hardsort, preciseworld, absoluteposition`
	CONCEPT	`circle (info \| search),` `imagined_entity (info \| search)`
	WORLD	`three_points [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP1136

The removal of any one loop disentangles the whole arrangement vs. not so.

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

	COMMENTS	`Left-hand examples are called "Brunnian links".`
	REFERENCE	`https://en.wikipedia.org/wiki/Brunnian_link`
	CROSSREFS	`Adjacent-numbered pages: BP1131 BP1132 BP1133 BP1134 BP1135 * BP1137 BP1138 BP1139 BP1140 BP1141`
	KEYWORD	`precise, hardsort`
	CONCEPT	`knot (info \| search)`
	WORLD	`link [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP1137

Constructible Polygon vs. Non-constructible Polygon

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

	REFERENCE	`https://en.wikipedia.org/wiki/Straightedge_and_compass_construction` `https://en.wikipedia.org/wiki/Constructible_polygon`
	CROSSREFS	`Adjacent-numbered pages: BP1132 BP1133 BP1134 BP1135 BP1136 * BP1138 BP1139 BP1140 BP1141 BP1142`
	KEYWORD	`stub, precise, math, hardsort, proofsrequired, preciseworld`
	AUTHOR	`Jago Collins`

BP1245

When two players alternate coloring regions, either can force connection from top edge to bottom edge vs. either can force connection from left edge to right edge.

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

	REFERENCE	`https://en.wikipedia.org/wiki/Hex_(board_game)`
	CROSSREFS	`Adjacent-numbered pages: BP1240 BP1241 BP1242 BP1243 BP1244 * BP1246 BP1247 BP1248 BP1249 BP1250`
	KEYWORD	`hard, precise, convoluted, dual, rotate, boundingbox, hardsort, challenge, proofsrequired, bordercontent`
	AUTHOR	`Aaron David Fairbanks`

( prev ) page 1 2

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