recentpopularlog in


« earlier   
Solving Every Sudoku Puzzle
In this essay I tackle the problem of solving every Sudoku puzzle. It turns out to be quite easy (about one page of code for the main idea and two pages for embellishments) using two ideas: constraint propagation and search.
game  Sudoku 
7 weeks ago by alligin
A Pencil-and-Paper Algorithm for Solving Sudoku Puzzles
The puzzle Sudoku has become the passion
of many people the world over in
the past few years. The interesting fact
about Sudoku is that it is a trivial puzzle
to solve. The reason it is trivial to solve
is that an algorithm exists for Sudoku solutions.
The algorithm is a tree-based search algorithm
based on backtracking in a tree until a solution is
game  Sudoku 
7 weeks ago by alligin
Sudoku solving algorithms - Wikipedia
A standard Sudoku contains 81 cells, in a 9×9 grid, and has 9 boxes, each box being the intersection of the first, middle, or last 3 rows, and the first, middle, or last 3 columns. Each cell may contain a number from one to nine, and each number can only occur once in each row, column, and box. A Sudoku starts with some cells containing numbers (clues), and the goal is to solve the remaining cells. Proper Sudokus have one solution. Players and investigators may use a wide range of computer algorithms to solve Sudokus, study their properties, and make new puzzles, including Sudokus with interesting symmetries and other properties.
game  sudoku 
7 weeks ago by alligin
Mas281/SudokuSolver-Go: A sudoku solving algorithm implementation in Go
GitHub is where people build software. More than 28 million people use GitHub to discover, fork, and contribute to over 85 million projects.
golang  sudoku 
10 weeks ago by geetarista
Sudoku and Backtracking – Hacker Noon
Sudoku is a number-placement puzzle where the objective is to fill a square grid of size ‘n’ with numbers between 1 to ‘n’. The numbers must be placed so that each column, each row, and each of the…
june 2018 by geetarista
Constraint satisfaction - Wikipedia
Constraint satisfaction problems on finite domains are typically solved using a form of search. The most used techniques are variants of backtracking, constraint propagation, and local search. These techniques are used on problems with nonlinear constraints.

Variable elimination and the simplex algorithm are used for solving linear and polynomial equations and inequalities, and problems containing variables with infinite domain. These are typically solved as optimization prob...
algorithms  algorithm  ai  sudoku 
may 2018 by hellsten
The SAT problem is the classical NP complete problem of searching for a satisfying assignment of a propositional formula in conjunctive normal form (CNF). General information on SAT can be found at or Our invited talk A Short History on SAT Solver Technology and What is Next? describes some of the new features of PicoSAT. The experimental data used in this talk is available as Biere-SAT07-talk-
math  puzzle  sudoku  sat  constraint  programming  game  solver  logic  satisfiability 
april 2018 by vrobin

Copy this bookmark:

to read