Hi there !
I noticed a weird behaviour. When I first tested your code, I ran examples in the fmaps/ folder and saw that you successfully find solutions larger than an 8x8 square but just now I wanted to show a friend how it worked and all and I tried a map containing 17 squares like this one :
##..
##..
....
....
And the program kept stuck more than 10 minutes.
Weirdly enough, it took less than 0.00 secs to solve the 16 squares version (the perfect 8x8 square)
Hi there !
I noticed a weird behaviour. When I first tested your code, I ran examples in the
fmaps/folder and saw that you successfully find solutions larger than an 8x8 square but just now I wanted to show a friend how it worked and all and I tried a map containing 17 squares like this one :##..
##..
....
....
And the program kept stuck more than 10 minutes.
Weirdly enough, it took less than 0.00 secs to solve the 16 squares version (the perfect 8x8 square)