The On-Line Encyclopedia of Bongard Problems

Search: ex:EX8126

Displaying 1-2 of 2 results found.

page 1

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

Palindromes vs. not palindromes.

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

	COMMENTS	`All examples in this Problem are sequences of graphic symbols. In this Problem, a "palindrome" is taken to be an ordered sequence which is the same read left-to-right as it is read right-to-left. A more formal solution to this Problem could be: "Sequences which are invariant under a permutation which swaps first and last entries, second and second last entries, third and third last entries, ... and so on vs. sequences which are not invariant under the aforementioned permutamation."`
	CROSSREFS	`Adjacent-numbered pages: BP981 BP982 BP983 BP984 BP985 * BP987 BP988 BP989 BP990 BP991`
	KEYWORD	`nice, precise, allsorted, notso, sequence, traditional`
	CONCEPT	`element_wise_symmetry (info \| search),` `identical (info \| search),` `sequence (info \| search),` `same_shape (info \| search),` `same (info \| search),` `symmetry (info \| search)`
	WORLD	`zoom in left \| zoom in right`
	AUTHOR	`Jago Collins`

BP1268

Palindromic when elements are grouped into (more than one) equal-sized blocks vs. no grouping of elements into (more than one) equal-sized blocks is palindromic.

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

	COMMENTS	`Any palindrome would be sorted left, except strings of length zero or one.`
	CROSSREFS	`Adjacent-numbered pages: BP1263 BP1264 BP1265 BP1266 BP1267 * BP1269`
	KEYWORD	`precise, allsorted, unwordable, sequence, traditional, miniworlds`
	CONCEPT	`element_wise_symmetry (info \| search),` `sequence (info \| search),` `same_shape (info \| search),` `same (info \| search)`
	WORLD	`zoom in left \| zoom in right`
	AUTHOR	`Leo Crabbe`

page 1

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