Solves the combinatorial game Soluna.
- Represent the board using a 2d array containing the information about the stack size of each symbol.
- Normalize the board to reduce the solution space.
- Solve using Dynamic Programming.
I also used heuristics and the set cover problem to minimize the optimal strategy game space.
My results matches with JBra's claims on BoardGameGeeks on which player can force a win based on starting position.