This project was made for the intelligent search algorithms course in my 4th year of studying Software Engineering in Damascus University.
Move the numbers along the grid and put them in their place in Sokonumber. All the numbers move in the same direction, so plan your path wisely.
The puzzles were taken from "https://www.puzzleplayground.com/soko_number"
Try it now here
You can play the puzzles yourself or you can let your computer do the hard work using one of these graph traversal algorithms:
- Breadth First Search (BFS)
- Depth First Search (DFS)
- Uniform Cost Search (UCS)
- A*
Note: The performance of these algorithms depends on the level's size and complexity.
The map is represented as a 2D string array.
#: a blockNumber: Cells that can move and should reach their destinations.Destination: Fixed cells and are represented in the array as letters e.g. "a".+/-: Cells that increase/decrease the value of the numbers that step on them.
The concept of the +/- cells is first introduced in level 7.
Starting from level 20 the numbers that move generate a block behind them so you can't go back to that position.