A question for the Swift Algorithm Club maintainers: would you be interested in a Swift implementation of Donald Knuth’s Algorithm X for solving the Exact Cover problem? I’ve been working on an implementation of it for use in a Sudoku generator, and it seems like a decent fit for the Club. I’m happy to try to whip it into shape to fit in the Swift Algorithm Club ecosystem on GitHub, but I don’t want to make that extra effort unless you’re interested.
FYI, my implementation isn’t specific to Sudoku, it’s an abstract solver that solves constraint matrices. The extension to solve Sudokus is fairly trivial due to the fact that Sudoku’s a classic example of the problem, but Knuth’s pentominoes examples or other constraint problems are equally solvable given a generated matrix (I’ve only done plist files for the 4x4 and 9x9 Sudoku constraints)
Thanks,
Matt Hartfield