>

I did it in 0.08sec
what other optimizations did you have that i dont have in my code?

[code deleted]

Edited by moderator 19.05.2020 22:17

if you notice that
4 blocks of first row and also first block of second row:
XXXX
X...
....
....

will force other blocks choosing...and these have 32ways only!
after selecting True or False for choose (and reverse) these blocks,
first block of first row will have just one side which never will
change by others:
X***
*OOO
OOOO
OOOO
{O never change side of X}
and all of '*'`s force the blocks under them
such as E forces D
XE**
*DOO
OOOO
OOOO
I mean that if E has same colour as X then D shouldn`t choose to
reverse (because after it side of E will change and it will be agains
the X and never change and....) and so on...
so should calculate just first 5 blocks and it is O(32)!!!

Sincerely
Aidin_n7@hotmail.com

I cannot understand what you have said.
Which 5 blocks do you choose?
Can you explain it to me?
Have you got AC?
Could you public your program？(If you don't want to talk much)（PASCAL will be better)
Thank you very much.

I encode the table to LongInt var (You may use Word if you want)

And then I use BFS, here is my code:

And I got 0.031s

[code deleted]

Edited by moderator 19.05.2020 22:18

862298 0.001 sec 34 KB