Graph representation of sliding puzzle

Question

I need to represent a sliding puzzle that goes from 2x2 to 4x4 using graphs. I am aware that a state of the puzzle can represent a vertex and the other possibilities are connected with edges. I am not sure how to begin and how to create the vertices and the connections with edges. For example, a 3x3 puzzle has 9! vertices, but how can I create that graph in java?

Answer 1

You can use JGraphT library. Have a look at Graph interface implementations for the supported graphs.