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 searches through its Puzzle's entire population of Facts too often #27
it may be faster to maintain and occasionally grow a list of neighboring Facts rather than to iterate over the Puzzle's factStream when growing/splitting a WhatIf
it may be faster to maintain and occasionally grow a list of neighboring Facts rather than to iterate over the Puzzle's factStream when growing/splitting a WhatIf