You should probably make this really clear. I probably wouldn't download either version, however without any clear difference from the other 1000s of clones I instantly dismissed it after not seeing anything new.
Yep, it requires n^2 moves for even boards while odd boards require less moves (no formula found yet). Using a computer, I found, by brute force, that the 5x5 can be solved in 8 moves at most, the problem quickly becomes intractable for 7x7 and above. It looks like this might be NP hard according to another post: http://stackoverflow.com/questions/27436275/how-can-i-furthe...
Why would anyone play this game when he could just diagonalize (nxm)x(nxm) matrix in F2 and get a basis? (in case of non-singular, otherwise impossible)
upd: misunderstood the game, it's about solving Ax=b in F2, so Gauss elimination.
I had fun playing this game for a while. Eventually I discovered some fairly reliable algorithms which enabled me to collect all the achievements. I'd like some bigger boards to have a go with now!
Glad to hear that you're enjoying the game! I've added the 8x8 board. In the average case, it can be solved in around 32 moves using the most optimal algorithm.
15 comments
[ 3.3 ms ] story [ 50.6 ms ] threadhttp://questgame.ru/images/pilots/2.jpg
Difficulty ratings:
- 2x2 board - Easy
- 3x3 board - Easy
- 4x4 board - Hard
- 5x5 board - Medium
- 6x6 board - Impossible
- 7x7 board - Hard
Shouldn't the difficulty rating increase with increasing board size?
To flip 4 squares in a 2 x 2 arrangement, hit all of those 4 squares.
What makes the bigger grids hard is the size of my little finger.