Solve sudoku puzzles by representing the puzzle as a bipartite graph of truth-claims about cells' values and rule-statements that have exactly one true neighbor and removing edges as information is added
MIT License
0
stars
0
forks
source link
WhatIf's lookup for its smallest affected Fact is inefficient #15
Tracking an evolving collection of affected Facts which is kept sorted smallest-to-largest and extracting get(0) when needed is much faster.