127.0.0.1: Created page with "A backtracking algorithm solves a Sudoku by trying to place a digit into a cell, then working out the consequences and placing other digits until the program either hits a..."

2021-10-25T18:05:51Z

Created page with "A backtracking algorithm solves a Sudoku by trying to place a digit into a cell, then working out the consequences and placing other digits until the program either hits a..."

New page

A backtracking algorithm solves a [[Sudoku]] by trying to place a digit into a cell, then working out the consequences and placing other digits until the program either hits a dead end, or finds a solution. If a dead end is reached, the algorithm then removes the placed digits and tries the alternatives. This process continues until all alternatives have been tried.

Another name for backtracking is [http://en.wikipedia.org/wiki/Depth_first_search depth-first search].

Popular backtracking algorithms for Sudoku are [[Dancing Links]], also known by its acronym DLX, and [[Ariadne's Thread]].

{{debate}}
[[Category:Solving Techniques]]

Backtracking Algorithms - Revision history

127.0.0.1: Created page with "A backtracking algorithm solves a Sudoku by trying to place a digit into a cell, then working out the consequences and placing other digits until the program either hits a..."