recentpopularlog in


« earlier   
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…
4 days ago 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 
18 days ago 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 
9 weeks ago by vrobin
Sudoku solving the easy way using boolean satisfiability » Luke's Blog
One of my recent interests has been in solving problems with various kinds of satisfiability solvers. As an introduction to this idea I want to demonstrate how to create a sudoku solver with almost no effort by reduction to a common satisfiability problem (CNF-SAT) and using an existing solver (MiniSat).
math  puzzle  sudoku  sat  constraint  programming  game  solver  logic 
9 weeks ago by vrobin
Sudoku Strategie
Strategien zur Lösung von Sodukos
games  sudoku  solutions  strategy  pdf  mathematics  2006 
10 weeks ago by navegador
Solving Every Sudoku Puzzle
The function parse_grid calls assign(values, s, d). We could implement this as values[s] = d, but we can do more than just that. Those with experience solving Sudoku puzzles know that there are two important strategies that we can use to make progress towards filling in all the squares:
py  guru  solver  code  ai  search  constraint  prog  puzzle  algo  sudoku  python  programming  algorithms  puzzles 
march 2018 by cjitlal
From an obfuscated Sudoku to Fibers and coroutines · On the Edge of Ruby
Which are the 2 solutions to this specific Sudoku puzzle. Running after changing the puzzle also solves the modified puzzle. Giving an empty puzzle (all _), the program will print every possible completed sudoku puzzle. However, that might take a while.
ruby  sudoku  solver  programming 
february 2018 by moonhouse
Magic Sudoku
I want this but for counting dominos.
arkit  sudoku 
january 2018 by jefftriplett

Copy this bookmark:

to read