Artificial Intelligence, n-Puzzle problem solver, approach: bidirectional BFS
Figure 1 - Example of an n-Puzzle, image from the book 'Artificial Intelligence: A Modern Approach'
- Clone the repository
- Run Terminal/Console in the root directory of the project
- Type in 'dotnet run'
- It's up and running (when using text file input - see the example_input.txt file for the structure) - Console UI should be self explanatory
- First line contains max iterations count - in case the problem has no solution (proposed value is 1000).
- Second line contains n-Puzzle width.
- Third line contains n-Puzzle height.
- The other lines are the initial and final state of the puzzle.
Empty place in the puzzle is represented by number 0. All numbers at positions in the puzzle have to be distinct (there cannot be more positions than 1 with the same number).