akabab / fillit Goto Github PK

Yo !

I just found your code, I am currently working on this assignment and I'm doing it with bitwise comparisons too. The solution map is an unsigned long long (64bit = 8x8 bits). I was wondering : is it possible to handle larger squares ? For example if we could use an array of 4 unsigned long longs as a map.

Thanks

error au lieu du usage
error si fd == -1
retirer le memset et le perror

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)

on passe pas le test

....
....
....
....

-> time out