I’m working on a Hitori solver. I’ve nearly finished encoding the rules. I’ll then see about writing some kind of algorithm to solve the puzzle.
Tonight’s task was to write a graph structure to represent the game grid. One of the rules is that the un-blackened-out squares must form a connected graph. It was fairly easy. I’m using depth-first search from the first non-black node to determine whether the graph is connected or not. Recursion is nice 🙂