# Combinatorial Explorations in Su-Doku

@article{Chauvet2008CombinatorialEI, title={Combinatorial Explorations in Su-Doku}, author={Jean-Marie Chauvet}, journal={ArXiv}, year={2008}, volume={abs/0803.4253} }

Su-Doku, a popular combinatorial puzzle, provides an excellent testbench for heuristic explorations. Several interesting questions arise from its deceptively simple set of rules. How many distinct Su-Doku grids are there? How to find a solution to a Su-Doku puzzle? Is there a unique solution to a given Su-Doku puzzle? What is a good estimation of a puzzle's difficulty? What is the minimum puzzle size (the number of "givens")?
This paper explores how these questions are related to the well…

## One Citation

### SudokuBee: An Artificial Bee Colony-based Approach in Solving Sudoku puzzles

- Computer Science
- 2010

The experiment results show that the ABC-based Sudoku solver has an excellent performance in solving the 6 x 6, 9 x 9 and 12 x 12 Sudoku puzzles with varying levels of difficulty, revealing the potential of the ABC algorithm in solving Sudoku problems.

## References

SHOWING 1-10 OF 24 REFERENCES

### A Fast Algorithm for the Bound Consistency of alldiff Constraints

- Computer ScienceAAAI/IAAI
- 1998

This paper presents a filtering algorithm for the alldiff constraint based on bound consistency whose running time complexity is very low and some experimental results prove its practical utility.

### A Filtering Algorithm for Constraints of Difference in CSPs

- Computer ScienceAAAI
- 1994

A new filtering algorithm is presented that achieves the generalized arc-consistency condition for these non-binary constraints and has been successfully used in the system RESYN, to solve the subgraph isomorphism problem.

### Enumerating possible Sudoku grids

- Mathematics
- 2005

The problem of enumerating all possible Sudoku grids is discussed, which is a very natural problem, but, perhaps surprisingly, it seems unlikely that the problem should have a simple combinatorial answer.

### Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint

- Computer Science, MathematicsCP
- 2000

This work presents narrowing algorithms for the sortedness and the alldifferent constraint which achieve bound-consistency and improves upon previous results.

### New Inference Rules for Max-SAT

- Computer ScienceJ. Artif. Intell. Res.
- 2007

A new Max-SAT solver is developed, called MaxSatz, which incorporates original inference rules that, besides being applied efficiently, transform Max- SAT instances into equivalents which are easier to solve, and these rules are proved in a novel and simple way via an integer programming transformation.

### The alldifferent Constraint: A Survey

- Computer ScienceArXiv
- 2001

A practical overview and an abstract comparison of several solving strategies for the constraint of difference in constraint pro- gramming are given.

### Upper bounds for permanent of (0,1)-matrices

- Bulletin of the American Mathematical Society,
- 1963

### Book reviews, permanents by henryk minc

- Bulletin of the American Mathematical Society,
- 1979