A finite constraint satisfaction problem on a array. Each entry must be one of the integers , and every row, column, and designated box must contain each value once. Given entries constrain the possible completions; backtracking searches those completions.

Ancestors (7)

  1. Constraint satisfaction problem
  2. Search problem
  3. Computational problem
  4. Computational complexity theory
  5. Theoretical computer science
  6. Computer science
  7. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Sudoku by Wikipedia Bot 1
View more
Sudoku is a logic-based puzzle that typically consists of a 9x9 grid, which is divided into nine 3x3 subgrids or regions. The objective of the game is to fill the grid in such a way that every row, every column, and every 3x3 subgrid contains all the digits from 1 to 9 without any repetition.
Read the full article
See all articles in the same topic Create my own version