If you can achieve this in under an hour, well, that'd be amazing!
If you are the only one, well, That'd be astounding!
If you are one of many, then he/she who does it the fastest wins!!!
Attached you will see a diagram of a 7 ring hex.
It contains 127 cells, arranged in a semi spiral pattern from the center outwards.
With 127 cells, if all the numbers 0 and 1 were as evenly entered in each and every cell, you would have either 64 cells with ones or 63 cells with ones.
I Propose the object is you must place 64 ones in those cells such that every row adds to an even number of ones.
The overall 7 ring hex has 39 rows, of which 13 are identified as the rows 0,3,6, 9,12,15,18,21,24,27,30,33,36
There are 26 other rows, in the two other 120 degree orientation.
Below you will see a text version of what each row's {G_n or Groupp} cell make up is.
Can you create a program such that it will iterate to its first valid arrangement in an hour or less?
BONUS POINTS1: Only 63 Cells with 1's, each row adds to an odd number!
BONUS POINTS2: Allow it to be expandable to N-Rings!
Reply With Quote