A java program that solves the Eight Puzzle problem using five different search algorithms.
The 8 puzzle consists of eight numbered, movable tiles set in a 3x3 frame. One cell of the frame is always empty thus making it possible to move an adjacent numbered tile into the empty cell. The following shows a sequence of legal moves from an initial board to the goal board.
The goal is to change the initial configuration into the goal configuration.
- Add Blind Search
- Fix code structure
- Add in package
- Code cleanup