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....
Uložené v:
| Vydané v: | The Journal of the Operational Research Society Ročník 65; číslo 10; s. 1602 - 1610 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
London
Taylor & Francis
01.10.2014
Palgrave Macmillan Palgrave Macmillan UK Taylor & Francis Ltd |
| Predmet: | |
| ISSN: | 0160-5682, 1476-9360 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!