Generate a logic problem. Model it as a binary constraint satisfaction problem (CSP). Choose a backtracking search algorithm. Watch the CSP get solved.
logic
constraint-satisfaction-problem
sudoku
n-queens
graph-colouring
futoshiki
shikaku
map-colouring
-
Updated
Oct 3, 2024 - C#