Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up

Sudoku CSP Solver using Backtracking Search and Arc-Consistency 3

NotificationsYou must be signed in to change notification settings

donovan-prehn/sudoku

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

Objective

Fill a 9x9 grid with digits

Rules

  1. Each row contains the numbers 1 to 9
  2. Each column contains the numbers 1 to 9
  3. Each box contains the numbers 1 to 9

Binary Constraint Satisfaction Problem

Variables

Variable for each tile in the sudoku grid with a total of 81 variables. Variable is a combination of a letter indicating the row, and a digit indicating the column.

X = {X1, X2, ..., X81}

Domains

Each variable Xi has the domain of the digits [1,9]

D = {D1, D2, ..., D81}

Di = {1, 2, 3, 4, 5, 6, 7, 8, 9}

Constraints

The value of each variable Xi cannot be equal to any value in its:

  • Row
  • Column
  • Box

Releases

No releases published

Packages

No packages published

Languages


[8]ページ先頭

©2009-2025 Movatter.jp