Talk:N-puzzle

From Wikipedia, the free encyclopedia

You have new messages (last change).

For inclusion: puzzle history at this page

[edit] Proof,

I have a strong background in mathematics but did not understand the proof. Can someone please clarify the language? Asteron 17:59, 29 August 2006 (UTC)

Yes, that piece seems to be unclear, but English is not my native language, and I perhaps can't clarify this in the best way. I suggest you to follow the link on top of this Talk Page and read the last but one paragraph there. I think, it's clear enough. Cmapm 18:33, 29 August 2006 (UTC)

[edit] Solution

The page states that there IS a hueristic to solve it, but doesn't give that solution. We definitely need this... Fieari 18:08, 29 August 2006 (UTC)

[edit] Parity

The parity does not change, regardless of the number of rows the empty block is moved. Every time the empty block changes rows, it creates an odd number of permutation inversions.

Retrieved from "http://en.wikipedia.org../../../n/-/p/Talk%7EN-puzzle_612a.html"