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

Revision history for BP562

Displaying 1-7 of 7 results found. page 1
     Edits shown per page: 25.
BP562 on 2020-07-26 08:04:04 by Aaron David Fairbanks                approved
NAME

There exists a closed trail that hits each vertex exactly once vs. not so.

COMMENTS

Left examples are called "Hamiltonian graphs."

EXAMPLE

AUTHOR

Aaron David Fairbanks

+DATA

 

EX6501
   

EX6502
   

EX6503
   

EX6504
   

EX6505
   

EX6506
 

-DATA

 

EX6507
   

EX6508
   

EX6509
   

EX6510
   

EX6511
   

EX6512
 

BP562 on 2020-07-25 02:24:01 by Aaron David Fairbanks                approved
NAME

COMMENTS

REFERENCE

CROSSREFS

EXAMPLE

AUTHOR

BP562 on 2020-07-06 12:33:59 by Aaron David Fairbanks                approved
NAME

Bongard Problems with "world" any collection of dot-like things that all look the same (any reskinned form of "dots" BP536) vs. other Bongard Problems

COMMENTS

EXAMPLE

BP562 on 2020-07-02 16:32:18 by Aaron David Fairbanks                approved
COMMENTS

See BP538 for possible reskins.

EXAMPLE

BP562 on 2020-07-02 02:04:20 by Aaron David Fairbanks                approved
NAME

Bongard Problems with "world" any reskinned forms of "dots" (BP536) vs. other Bongard Problems

COMMENTS

EXAMPLE

AUTHOR

Aaron David Fairbanks


Welcome | Solve | Browse | Lookup | Recent | Links | Register | Contact
Contribute | Keywords | Concepts | Worlds | Ambiguities | Transformations | Invalid Problems | Style Guide | Goals | Glossary