PlaySudoku.us
Easy · Puzzle #933
4
6
1
9
3
2
3
1
5
6
9
9
2
6
1
3
2
8
6
5
5
3
2
6
4
3
7
8
9
8
3
9
6
7
2
1
4
8
9
6
3
6
2
7
3
1
5
Graph coloring and Sudoku are equivalent problems. Each cell is a node; edges connect cells that share a house. Solving Sudoku = coloring the graph with 9 colors.
Graph coloring and Sudoku are equivalent problems. Each cell is a node; edges connect cells that share a house. Solving Sudoku = coloring the graph with 9 colors.
Network flow algorithms can solve special classes of Sudoku more efficiently than general backtracking.
Network flow algorithms can solve special classes of Sudoku more efficiently than general backtracking.