An Algorithm for 3D Chess
My artificial intelligence course this semester has been an interesting one, and the midterm exam is no exception. Rather than testing in-class on what we’ve been learning, our professor gave us a take-home exam that was a practical exercise in A* search algorithms. The problem we were given was to design an A* search algorithm that can find the shortest path a chess knight can take on a 9x9x9 Rubik’s cube to reach a goal at any position on the cube, from any starting position. The algorithm should accommodate the following constraints: ...