↪︎ Solving NRK's Former with Monte Carlo Tree Search
In this project, I implemented the Single-Player Monte Carlo Tree Search (SP-MCTS) (Schadd et al., 2008) algorithm to solve NRK Former, a puzzle game developed by the Norwegian Broadcasting Corporation (NRK). The goal of the game is to remove all blocks from a 9x7 grid using as few moves as possible by clicking on connected blocks of the same color.
Check out the repository and try it out yourself!
Note: I also implemented a model using Deep Q-Networks (DQN) to solve the same game, but I found that the MCTS approach was more effective for this particular problem. You can find that implementation here.
