Solving Japanese puzzles with heuristics

Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Games, CIG 2007

Volumn , Issue , 2007, Pages 224-231

  Salcedo Sanz, Sancho ^a   Ortíz García, Emilio G ^a   Pérez Bellido, Angel M ^a   Portilla Figueras, Antonio ^a   Yao, Xin ^b  

^a UNIVERSITY OF ALCALÁ   (Spain)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Heuristics; Japanese puzzles; Nonograms; Puzzles solver

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; INFORMATION ANALYSIS; PROBLEM SOLVING; WEBSITES;

CONSTRAINT PROGRAMMING; JAPANESE PUZZLES; PUZZLES SOLVERS;

GAME THEORY;

EID: 34548784281     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2007.368102     Document Type: Conference Paper

References (20)

1. J. E. Laird, "Using a computer game to develop advanced AI", IEEE Computer, vol. 34, no. 7, pp. 70-75, 2001.
2. H. J. Herik, H. van Den and H. Iida, (eds.), Games in AI Research, Universiteit Maastricht, Maastricht, 2000.
3. A. Khoo, R. Zubek, "Applying inexpensive AI techniques to computer games", IEEE Intelligent Systems, vol. 17, no. 4, pp.48-53, 2002.
4. J. M. Vaccaro, C. C. Guest, "Planning an endgame move set for the game RISK: a comparison of search algorithms", IEEE Transactions on Evolutionary Computation, vol. 9, no. 6, pp. 641- 652, 2005.
5. C. Jefferson, A. Miguel, I. Miguel and T. Armagan, "Modelling and solving English Peg Solitaire," Computers & Operations Research, In Press, 2005.
6. K. D. Smith, "Dynamic programming and board games: A survey," European Journal of Operational Research, In Press, 2005.
7. S. S. Lucas and G. Kendall, "Evolutionary computation and games," IEEE Computational Intelligence Magazine, vol. 1, no. 1, pp. 10-18, 2006.
8. http://www.conceptispuzzles.com
9. http://www.conceptispuzzles.comproductspicapix puzzle_samples.htm
10. M. Dorant, "A begginer's guide to solving picture forming logic puzzles," http://www.conceptispuzzles.comproductspicapix solving_a_puzzle.htm.
11. http://www.comp.lancs.ac.ukcomputingusersssnonogram index.html
12. G. Duncan, "Puzzle Soving", B.Sc. Degree Final Project Report, University of York, Computer Science Department, 1999.
13. G. Duncan Solver, http://www-users.c.york.ac.uk~twprojects nonograms
14. N. Ueda and T. Nagao, "NP-completeness results for nonograms via parsimonious reductions," Internal Report, University of Tokyo, Computer Science Department, 1996.
15. S. Salcedo-Sanz, J. A. Portilla-Figueras, E. G. Ortíz- García, A. M. Pérez-Bellido, and X. Yao, "Teaching advanced features of evolutionary algorithms using Japanese puzzles", IEEE Transactions on Education, accepted for publication, 2006.
16. B. J. Batenburg, B. J. and W. A. Kosters, "A discrete tomography approach to Japanese puzzles", In Proceedings of the Belgian-Dutch Conference on Artificial Intelligence, pp. 243-250, 2004.
17. J. Benton, R. Snow and N. Wallach, "A combinatorial problem associated with nonograms," Internal Report, University of Standford, Artificial Intelligence Department, 2005.
18. D. E. Goldberg, Genetic algorithms in search, optimization and machine learning, Reading:MA, Addison-Wesley, 1989.
19. V. Kumar, "Algorithms for constraints satisfaction problems: a survey," The AI Magazine, vol. 13, no. 1, pp. 32-44, 1992.
20. G. Pesant, "A regular language membership constraint for finit sequences of variables," In Proc. of the 10th Int. Conf. on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 3258, pp. 482-495, 2004.