Automated generation and visualization of picture-logic puzzles

Computers and Graphics (Pergamon)

Volumn 31, Issue 5, 2007, Pages 750-760

  Ortiz García, Emilio G ^a   Salcedo Sanz, Sancho ^a   Leiva Murillo, Jose M ^b   Pérez Bellido, Angel M ^a   Portilla Figueras, José A ^a  

^a UNIVERSITY OF ALCALÁ   (Spain)

^b UNIVERSIDAD CARLOS III DE MADRID   (Spain)

Author keywords

Algorithms; Automated puzzles generation; Graphic interfaces; Heuristics; Picture logic puzzles; Puzzles solvers

Indexed keywords

COMPUTATIONAL EFFICIENCY; FORMAL LOGIC; GRAPHICAL USER INTERFACES; HEURISTIC ALGORITHMS; IMAGE ANALYSIS; PROBLEM SOLVING;

AUTOMATED PUZZLES GENERATION; GRAPHIC INTERFACES; PICTURE LOGIC PUZZLES; PUZZLES SOLVERS;

DATA VISUALIZATION;

EID: 35349002186     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cag.2007.08.006     Document Type: Article

References (31)

1. Laird J.E. Using a computer game to develop advanced AI. IEEE Computer 34 7 (2001) 70-75
2. In: Van den Herik H., and Iida H. (Eds). Games in AI research (2000), Universiteit Maastricht, Maastricht
3. Vaccaro J., and Guest C. Planning an endgame move set for the game RISK: a comparison of search algorithms. IEEE Transactions on Evolutionary Computation 9 6 (2005) 641-652
4. Jefferson C., Miguel A., Miguel I., and Armagan Tarim S. Modelling and solving English Peg Solitaire. Computers & Operations Research 33 10 (2006) 2935-2959
5. Smith K. Dynamic programming and board games: a survey. European Journal of Operational Research 176 3 (2007) 1299-1318
6. Lucas S., and Kendall G. Evolutionary computation and games. IEEE Computational Intelligence Magazine 1 1 (2006) 10-18
7. Khoo A., and Zubek R. Applying inexpensive AI techniques to computer games. IEEE Intelligent Systems 17 4 (2002) 48-53
8. Conceptis Puzzles Inc., 〈http://www.conceptispuzzles.com〉
9. Catchy Software Inc., 〈http://www.catchysoft.com/jcwd.html〉.
10. Nikoli Software Inc., 〈http://www.nikoli.co.jp/en/〉
11. Ishida N. Sunday Telegraph book of nonograms (1993), Pan Publishers
12. Benton J., Snow R., and Wallach N. A combinatorial problem associated with nonograms. Linear Algebra and its Applications 412 1 (2006) 30-38
13. Ueda N, Nagao T. NP-completeness results for nonograms via parsimonious reductions. Internal Report, Computer Science Department, University of Tokyo, 1996.
14. Dorant M. A beginner's guide to solving picture forming logic puzzles 〈http://www.conceptispuzzles.com{minus 45 degree rule}products{minus 45 degree rule}picapix{minus 45 degree rule}solving_a_puzzle.htm〉.
15. Duncan G. Puzzle solving. B.Sc. Degree Final Project Report, Computer Science Department, University of York, 1999.
16. 〈http://www.comp.lancs.ac.uk{minus 45 degree rule}computing{minus 45 degree rule}users{minus 45 degree rule}ss{minus 45 degree rule}nonogram{minus 45 degree rule}index.html〉.
17. Batenburg B, Kosters W. A discrete tomography approach to Japanese puzzles. In: Proceedings of the Belgian-Dutch conference on artificial intelligence, 2004. p. 243-50.
18. Wiggers W. A comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms. In: Proceedings of the first Twente student conference on IT, 2004. p. 1-6.
19. Salcedo-Sanz S., Portilla-Figueras J., Bellido A.Perez., Ortiz-García E., and Yao X. Teaching advanced features of evolutionary algorithms using Japanese puzzles. IEEE Transactions on Education 50 2 (2007) 151-155
20. Salcedo-Sanz S, Ortiz-García E, Pérez.Bellido A, Portilla-Figueras J, Yao X. Solving Japanese puzzles with heuristics. In: IEEE symposium on computational intelligence and games, Honolulu, USA, April 2007.
21. 〈http://www.conceptispuzzles.com{minus 45 degree rule}products{minus 45 degree rule}picapix{minus 45 degree rule}puzzle_samples.htm〉.
22. Bracewell R. Two-dimensional imaging (1995), Prentice-Hall, Englewood Cliffs, NJ
23. Lim J. Two-dimensional signal and image processing (1990), Prentice-Hall, Englewood Cliffs, NJ
24. Goldberg D. Genetic algorithms in search, optimization and machine learning (1989), Addison-Wesley, Reading, MA
25. Alp O., Erkut E., and Drezner Z. An efficient genetic algorithm for the p-median problem. Annals of Operations Research 122 (2003) 21-42
26. Senne E., Lorena L., and Pereira M. A branch-and-price approach to p-median location problems. Computers & Operations Research 32 6 (2005) 1655-1664
27. Rosing K., and Hodgson M. Heuristic concentration for the p-median: an example demonstrating how and why it works. Computers & Operations Research 29 10 (2002) 1317-1330
28. Salcedo-Sanz S., Camps-Valls G., Pérez-Cruz F., Sepúlveda-Sanchis J., and Bousoño-Calzón C. Enhancing genetic feature selection through restricted search and Walsh analysis. IEEE Transactions on Systems, Man and Cybernetics Part C 34 4 (2004) 398-406
29. Atsalakis A., and Papamarkos N. Color reduction and estimation of the number of dominant colors by using a self-growing and self-organized neural GAs. Engineering Applications of Artificial Intelligence 19 7 (2006) 769-786
30. Ullrich T, Fellner D. AlgoViz-a computer graphics algorithm visualization toolkit. In: Proceedings of World conference on educational multimedia, hypermedia and telecommunications, Chesapeake, USA, 2004. p. 941-8.
31. Dogrusoz U., Feng Q., Madden B., Doorley M., and Frick A. Graph visualization toolkits. IEEE Computer Graphics and Applications 22 1 (2002) 30-37