The On-Line Encyclopedia of Bongard Problems

Search: subworld:everything

Displaying 591-600 of 799 results found.

( prev | next ) page 1 ... 56 57 58 59 60 61 62 63 64 ... 80

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

BP1006

The sum of all dot clumps has the same numerical property as each of the dot clumps vs. not so.

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

	CROSSREFS	`This is a version of BP1003 with only numbers.` `Contrast BP1005, which is very similar.` `Adjacent-numbered pages: BP1001 BP1002 BP1003 BP1004 BP1005 * BP1007 BP1008 BP1009 BP1010 BP1011`
	KEYWORD	`nice, hardsort, left-narrow, rules`
	CONCEPT	`recursion (info \| search),` `self-reference (info \| search)`
	WORLD	`[smaller \| same \| bigger] zoom in left \| zoom in right`
	AUTHOR	`Leo Crabbe, Aaron David Fairbanks`

BP1008

The 26th from the left, 63rd from the top pixel is black versus white.

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

	COMMENTS	`This is a typical kind of joke answer people give for Bongard Problems when they cannot find an answer.`
	CROSSREFS	`Adjacent-numbered pages: BP1003 BP1004 BP1005 BP1006 BP1007 * BP1009 BP1010 BP1011 BP1012 BP1013`
	KEYWORD	`dual, arbitrary, handed, leftright, updown, boundingbox, blackwhite, antihuman, right-null, perfect, pixelperfect, help, experimental, funny, absoluteposition, bordercontent`
	CONCEPT	`specificity (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP1011

Polygon can be inscribed in a circle vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP1006 BP1007 BP1008 BP1009 BP1010 * BP1012 BP1013 BP1014 BP1015 BP1016`
	KEYWORD	`hard, precise, stretch, challenge, left-narrow, perfect, preciseworld`
	CONCEPT	`circle (info \| search),` `imagined_entity (info \| search)`
	WORLD	`fill_polygon [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP1012

No tile shares a partial side with another tile vs. not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP1007 BP1008 BP1009 BP1010 BP1011 * BP1013 BP1014 BP1015 BP1016 BP1017`
	KEYWORD	`precise, allsorted, perfect`
	CONCEPT	`infinite_plane (info \| search),` `tessellation (info \| search),` `tiling (info \| search)`
	WORLD	`wallpaper_tiling_1_polygon [smaller \| same \| bigger] zoom in left`
	AUTHOR	`Leo Crabbe`

BP1013

Neighbouring tiles share exactly 1 side vs not so.

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

	CROSSREFS	`Adjacent-numbered pages: BP1008 BP1009 BP1010 BP1011 BP1012 * BP1014 BP1015 BP1016 BP1017 BP1018`
	KEYWORD	`precise, allsorted, perfect`
	CONCEPT	`infinite_plane (info \| search),` `tessellation (info \| search),` `tiling (info \| search)`
	WORLD	`wallpaper_tiling_1_polygon [smaller \| same \| bigger] zoom in left`
	AUTHOR	`Leo Crabbe`

BP1014

Shapes become thicker the farther they are from the top-left and bottom-right corners of bounding box vs. some other pattern in shape thickness based on position.

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

	REFERENCE	`https://studentweb.cs.wwu.edu/~tuora/aarontuor/computerscience/bongardproblems.html`
	CROSSREFS	`Adjacent-numbered pages: BP1009 BP1010 BP1011 BP1012 BP1013 * BP1015 BP1016 BP1017 BP1018 BP1019`
	KEYWORD	`handed, leftright, updown, rotate, boundingbox, bordercontent`
	CONCEPT	`size (info \| search)`
	AUTHOR	`Aaron Tuor`

BP1015

Segment drawn between two points intersects another line vs segment drawn between two points does not intersect any other lines

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

	CROSSREFS	`This is nearly identical to BP163. Here instead of shape outlines dots are used, and the dots can be within the larger shape outline.` `Adjacent-numbered pages: BP1010 BP1011 BP1012 BP1013 BP1014 * BP1016 BP1017 BP1018 BP1019 BP1020`
	KEYWORD	`easy, precise`
	CONCEPT	`dot (info \| search),` `imagined_line_or_curve (info \| search),` `imagined_entity (info \| search),` `object_line_overlap (info \| search),` `overlap (info \| search)`
	AUTHOR	`Peter Nesin`

BP1016

Rigid vs. not rigid.

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

	REFERENCE	`Henneberg, L. (1911), Die graphische Statik der starren Systeme, Leipzig` `Jackson, Bill. (2007). Notes on the Rigidity of Graphs.` `Laman, Gerard. (1970), "On graphs and the rigidity of plane skeletal structures", J. Engineering Mathematics, 4 (4): 331–340.` `Pollaczek‐Geiringer, Hilda (1927), "Über die Gliederung ebener Fachwerke", Zeitschrift für Angewandte Mathematik und Mechanik, 7 (1): 58–72.`
	CROSSREFS	`Adjacent-numbered pages: BP1011 BP1012 BP1013 BP1014 BP1015 * BP1017 BP1018 BP1019 BP1020 BP1021`
	KEYWORD	`nice, physics, help`
	CONCEPT	`rigidity (info \| search),` `graph (info \| search),` `imagined_motion (info \| search)`
	WORLD	`planar_connected_graph [smaller \| same \| bigger] zoom in left (rigid_planar_connected_graph)`
	AUTHOR	`Aaron David Fairbanks`

BP1017

Line segments linking same-coloured dots would intersect vs. not so.

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

	CROSSREFS	`This is a less noisy version of BP261.` `Adjacent-numbered pages: BP1012 BP1013 BP1014 BP1015 BP1016 * BP1018 BP1019 BP1020 BP1021 BP1022`
	KEYWORD	`easy, nice, precise, allsorted, perfect, traditional, finishedexamples, preciseworld`
	CONCEPT	`lines_coincide (info \| search),` `imagined_line_or_curve (info \| search),` `imagined_entity (info \| search),` `overlap (info \| search)`
	AUTHOR	`Leo Crabbe`

BP1019

White space in two circles maximum vs. white space in three circles maximum.

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

	CROSSREFS	`Adjacent-numbered pages: BP1014 BP1015 BP1016 BP1017 BP1018 * BP1020 BP1021 BP1022 BP1023 BP1024`
	KEYWORD	`nice, precise, traditional`
	CONCEPT	`recursion_number (info \| search),` `separated_regions (info \| search),` `circle (info \| search),` `recursion (info \| search),` `two (info \| search),` `three (info \| search)`
	WORLD	`circles_cross [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

( prev | next ) page 1 ... 56 57 58 59 60 61 62 63 64 ... 80

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