How we did it
Strategy and Solver Engine

This is a final result:

We made a Darwin Machine. The picture below shows the grid with a neutral sexehexes perimeter. This forces the edge (the yellow sexehexes). The program places the tiles in random mode. It finds the corners first, and then it follows the blue spiral until the center. If no sexehex enters in a place, the Darwin Machine start again.

After 3.147.955 attempts, we found this not-solution: the central place could be only covered with the piece "X" which it is already in use.

The sexehex "A" is different for a female edge only. We insert it, and then we exchange "C" and "D", "E" and "F", "H" and "I", "J" and "K", and finally "L" and "M".

________________

If I use 127 full random sexehexes, the probability of inserting every piece is:

(1/3)^(common_edges_nr.) = (1/3)^423 =~ 1/10^202

127 one-side sexehexes have many combinations of staying on this hexagonal grid:

(6^127)*(127!) =~ 10^312

There are ~10^110 solutions, but I must do 10^202 attempts to find one! Is it possible? Is it true? Am I saying mistakes? Am I lucky to find one solution? Is anybody on-line with answers?

 Below you'll find a mirror of Livio Zucca pages. Click here for my home