A comparison of several enumerative algorithms for Sudoku

Sudoku is a puzzle played of an n × n grid where n is the square of a positive integer m. The most common size is n=9. The grid is partitioned into n subgrids of size m × m. The player must place exactly one number from the set N={1, ..., n} in each row and each column of as well as in each subgrid....

Full description

Saved in:

Bibliographic Details
Published in:	The Journal of the Operational Research Society Vol. 65; no. 10; pp. 1602 - 1610
Main Authors:	Coelho, Leandro C, Laporte, Gilbert
Format:	Journal Article
Language:	English
Published:	London Taylor & Francis 01.10.2014 Palgrave Macmillan Palgrave Macmillan UK Taylor & Francis Ltd
Subjects:	Algorithms backtracking Business and Management constraint programming Datasets Game theory General Paper General Papers Heuristics Integer programming Integers linear and non-linear integer programming Linear programming Management Mathematical analysis Mathematical models Mathematical programming Mathematical puzzles Modeling Operations research Operations Research/Decision Theory puzzle Puzzles Studies Sudoku backtracking linear and non-linear integer programming Sudoku puzzle constraint programming
ISSN:	0160-5682, 1476-9360
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!