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
Looking for the smallest Fact by sorting the whole list may be inefficient #16
Scanning the factStream, keeping track of the smallest Fact yet found, and short-circuiting when a Fact of size (affected size, as in a lastSizes Map) 1 is found may be faster, depending on the sort algorithm used in Stream.sorted().
Scanning the factStream, keeping track of the smallest Fact yet found, and short-circuiting when a Fact of size (affected size, as in a lastSizes Map) 1 is found may be faster, depending on the sort algorithm used in Stream.sorted().