The On-Line Encyclopedia of Bongard Problems

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`

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