I programmed up an n-puzzle solver that uses A*. It doesn't work. I am sad. I am trying to implement the Manhatten distance with linear conflicts heuristic, but the brute force approach seems to me to be a waste of time. I'm sure that there's a smart way to do this, but I can only think of an O(n^3) {or so} solution. Can you guys tell me to stop being a dumbass and figure it out?
On a second note, you can't be a British programmer and not be used to `color' anyway. Besides, there are thousands of other minor similarities we could be arguing about. Ground Floor/1st Floor/2nd Floor vs 1stFloor/SecondFloor/ThirdFloor anyone?