A tool for visualizing the functionality of algorithms for solving Sokoban puzzles

Sokoban is a puzzle game that offers computationally complex problems that are very difficult to solve. There are many algorithms that can be used to solve these problems, but none is successful in solving all given, even relatively simple problems. Therefore, the game Sokoban is an interesting platform both for the improvement of the search algorithms and for a better understanding. In this thesis we propose an application that can be used both as a tool to support the developers of these algorithms, or as a means to analyze and teach their functioning. We present the development process of the application, test its functionality on practical Sokoban puzzles and show that it works correctly and is a relevant tool