Q: Can we construct a complete graph of the 8-puzzle problem space as we can for the FWGC problem or the water jug problem?

Such a graph would have to accommodate any initial state and thus must include every possible state of the 8-puzzle.

Q: About how many states is that?