I'm trying to test whether a 15 puzzle is solvable. I wrote a method which is working for most puzzles, but for some not. For example this puzzle can be solved with two moves (0, 11), (0, 12) 1, ...

I am trying to find a way to programmatically solve a 24-piece sliding puzzle in a reasonable amount of time and moves. Here is an example of the solved state in the puzzle I am describing: I h...

I am trying to create a tree with the different possible states of the well-known sliding puzzle In case you don't know it, it's the one like: [3 5 2] [4 1] [8 6 7] Where you have to make it li...

I am implementing a NxN puzzle solver using A* search algorithm and using Manhattan distance as a heuristic and I've run into a curious bug (?) which I can't wrap my head around. Consider these pu...

I have built a 8 puzzle solver using Breadth First Search. I would now want to modify the code to use heuristics. I would be grateful if someone could answer the following two questions: Solvabili...

The 8-puzzle will be represented by a 3x3 list of lists positions where the empty box will be represented by the value 9, as shown below: [[9,1,3],[5,2,6],[4,7,8]] Possibility Solution: Only half ...

I am looking for code in java that implement DFS and BFS for the 8-puzzle game by given initial state : 1 2 3 8 0 4 7 6 5 and Goal state 2 8 1 0 4 3 7 6 5 I need to print the solution path fr...

The classical 8-puzzle belongs to the family of sliding blocks. My book (Artificial intelligence A modern approach by Stuart Russell and peter Norwig) says that the 8-puzzle has 9!/2 possible state...

The 8-puzzle is a square board with 9 positions, filled by 8 numbered tiles and one gap. At any point, a tile adjacent to the gap can be moved into the gap, creating a new gap position. In other wo...

Is there a way that I can optimize this code as to not run out of memory? import java.util.HashMap; import java.util.Map; import java.util.PriorityQueue; import java.util.Random; import java....