Como trabalhos futuros, deverão ser feitos novos estudos sobre as características dos Nonogramas, aumentar os tamanhos dos mesmos e implementar novos métodos de busca local que possam ajudar na solução do puzzle. Também há planos de se estender a abordagem a Nonogramas coloridos.
O problema da Tomografia Discreta (Discrete Tomography - DT) pode ser um modelo para diversos problemas reais, como no campo da engenharia médica (Wang e
Lu, 1992). Tem-se o objetivo de adaptar as metaheurísticas propostas neste trabalho ao problema da Tomografia Discreta.
O estudo dos parâmetros deve ser ampliado, para chegar na melhor configuração de cada algoritmo proposto. As heurísticas propostas gastam um tempo elevado para resolver puzzles maiores, essa limitação deve ser estudada e novas técnicas implementadas para tentar reduzir o tempo gasto pelas abordagens.
Referências
BATENBURG, K. J., & KOSTERS, W. A. A discrete tomography approach to Japanese puzzles. Proceedings of the Belgian-Dutch Conference on Artificial Intelligence, p. 243-250, 2004.
BATENBURG, K. J. An evolutionary Algorithm for Discrete Tomography. Discrete Applied Mathematics, v. 151, n. 1-3, p. 36-54, 2005.
BATENBURG, K. J., & KOSTERS, W. A. Solving Nonograms by combining relaxations. Advances in combinatorial image analysis, v. 42, n. 8, p. 1672-1683, 2009.
BENCHMARCK PUZZLES. Acesso em 18 de jullho 2012. Disponível em http://homepages.cwi.nl/~aeb/games/jpuzzlegraded/index.html.
BENTON, J.; SNOW, R.; WALLACH, N. A combinatorial problem associated with nonograms. Linear Algebra and its Applications, v. 412, p. 30-38, 2005.
BIEDL, T. et al. The Complexity of Clickomania. More Games of No Chance (R. Nowakowski), p. 384-404, 2002.
BOSCH, R. A. Painting by numbers, Mathematical Programming Society Newsletter, OPTIMA 65, p. 16-17, 2000.
CONCEPTIS PUZZLES. Pic-a-Pix. Acesso em 18 jul. 2012. Disponível em:: http://www.conceptispuzzles.com/.
CORMODE, G. The hardness of the lemmings game, or Oh no, more NP-completeness proofs. Proceedings of Third International Conference on Fun with Algorithms, p. 65- 76, 2004.
DOR, D.; ZWICK, U. SOKOBAN and other motion planning problems. Computational Geometry: Theory and Applications, v. 13, n. 4, p. 215-228, 1999.
DORANT, M. Pic-a-Pix Tutorial and Walkthroughs. Acesso em 12 de Jan. 2012, disponível em: Conceptis Puzzle: http://conceptispuzzles.com, 2005.
EÉN, N.; SORENSSON, N. An Extensible SAT-solver. The MiniSat page. Acesso em 26 de Ab. 2012. Disponível em: http://minisat.se/MiniSat.html, 2003.
FRAENKEL, A. S.; JOHNSON, D. S.; SCHAEFER, T.; & Yesha, Y. The complexity of checkers on an NxN board - preliminary report. Proceedings of 19th Annual Symposium on Fundations of Computer Science, p. 55-64, 1978.
FRAENKEL, A. S.; LICHTENSTEIN, D. Computing a perfect strategy fo NxN chess requires time exponential in n. Jornal of Combinatory Theory, v. 31 (Series A), p. 199- 214, 1981.
FRIEDMAN, E. Spiral Galaxies Puzzles are NP-complete. Disponível em http://www2.stetson.edu/˜efriedma/papers/spiral.pdf. Acesso em 9 de Jan. 2012.
GERBRANDS, C.; SLUMP, J. A network flow approach to recon- struction of the left ventricle from two projections. Computer Graphics and Image Processing, v. 18, p. 18- 36, 1982.
GLOVER, F. Future paths for integer programming and links to artificial intelligence, Computers & Operations Research, v. 13, p. 533-549, 1986.
GLOVER, F. Tabu search – Part I, ORSA Journal on Computing, v. 1, p. 190-206, 1989.
GLOVER, F.; LAGUNA, M. Tabu Search. Kluwer Academic Publishers, 1997.
GOLDBARG, M. C; TAUMATURGO, C. N. O; GOLDBARG, E. F. G. Algoritmo Busca Tabu para a solução do Nonograma. XLIII Simpósio Brasileiro de PESQUISA OPERACIONAL, 2011.
GOLDBERG, D. E.; VOESSNER, S. Optimizing global-local search hybrids. GECCO, p. 220-228, 1999.
HANSEN, P. The steepest ascent mildest descent heuristic for combinatorial programming. Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy, 1986.
HATTORI. Acesso em 18 de jul. 2012. Disponível em
http://www.hattori.m78/puzzles/java/stage_01/index.html.
HERIK, H. J.; VAN DEN, H.; IIDA, H. Games in AI Research. University Maastricht, 2000.
HOLZER, M.; HOLZER, W. Tantrix rotation puzzles are intractable. Discrete Applied Mathematics, v. 144, n. 3, 2004.
HOOGEBOOM, H. J.; KOSTERS, W. A. Tetris and decidability. Information Processing Letter, v. 89, n. 6, p. 267-272, 2004.
JEFFERSON, C. et al. Modelling and solving english peg solitaire. Computers & Operations Research, v. 33, n. 10, p. 2935-2959, 2006.
JING, M-Q. et al. Solving japanese puzzles with logical rules and depth first search algorithm, Proceedings of the Eighth International Conference on Machine Learning and Cybernetics, Baoding, p. 2962-2967, 2009.
JONG, K. A.; SPEARS, W. M. Using genetic algorithm to solve np-complete problems. In Proc. of the Third Int. Conf. on Genetic Algorithms, p. 24-132, 1989.
KAYE, R. Minesweeper is NP-complete. Mathematical Intelligencer, v. 22, p. 9-15, 2000.
KEMPE, D. On the complexity of the Reflections game. Acesso em 9 de Jan. 2012, disponível em http://www-bcf.usc.edu/~dkempe/publications/reflections.pdf, 2003.
KHOO, A.; ZUBEK, R. Applying inexpensive AI techniques to computer games. IEEE Intelligent System, v. 17, n. 4, p. 48-53, 2002.
KISIELOWSKI, C. et al. An approach to quantitative high-resolution transmission electron microscopy of crystalline materials. Ultramicroscopy, v. 58, p. 131-155, 1995.
KRÁL, D. et al. It is tough to be a plumber. Theoretical Computer Science, v. 313, n. 3, p. 473-484, 2004.
LAIRD, J. E. Using a computer game to develop advanced AI. IEEE Computer, v. 34, n. 7, p. 70-75, 2001.
LICHTENSTEIN, D.; SPISER, M. GO is polynomial-space hard. Journal of the ACM, v. 27, n. 2, p. 393-401, 1980.
LUCAS, S. S.; KENDALL, G. Evolutionary computation and games. IEEE Computational Intelligence Magazine, v. 1, n. 1, p. 10-18, 2006.
McPHAIL, B. P. The Complexity of Puzzles: NP-Completeness Results for Nurikabe and Minesweeper. Thesis for BA, Division of Mathematics and Natural Sciences, Reed College. 2003.
McPHAIL, B. Light Up is NP-Complete. Acesso em 9 de Jan. 2012, disponível em http://www.cs.umass.edu/~mcphailb/papers/2005lightup.pdf, (2005).
MONTEIRO, S. M. D. Algoritmos Evolucionários para o Problema da Configuração do Traçado de Redes de Distribuição de Gás Natural. Manografia (Graduação em Engenharia de Computação). Universidade Federal do Rio Grande do Norte, 2009.
MINGOTE, L. P. C. F. Solving Colored Nonograms. 2009. 98f. Dissertação (Mestrado em Engenharia Informática). Faculdade de Ciência e Tecnologia, Universidade Nova de Lisboa, Lisboa, 2009.
NONOGRAM SOLVER. Acesso em 18 de julho 2012. Disponível em: http://www.comp.lancs.ac.uk/~ss/nonogram/.
OCHOA, A. Resolution of a combinatorial problem using cultural algorithms. Journal of Computers, v. 4, n. 8, 2009.
ONNASCH, D.; Prause, G. Heart chamber reconstruction from biplane angiography. v. 17, n. 12, p. 385-401, 1999.
ORTIZ-GARCÍA, E. G. et al. Automated generation and visualization of picture-logic puzzles. Computers and Graphics, v. 31, p. 750-760, 2007.
ORTIZ-GARCÍA, E. G. et al. Solving very difficult japanese puzzles with a hybrid evolutionary-logic algorithm, Lecture Notes in Computer Science, v. 5361, p. 360-369, 2008.
ORTIZ-GARCÍA, E. G. et al. Improving the performance of evolutionary algorithms in grid-based puzzles resolution, Evolutionary Intelligence, v. 2, n. 4, p. 169-181, 2009.
RYSER, H. J. Combinaorial properties of matrices zeros and ones. Canadian Jornal of Mathematics, v. 9, p. 371-377, 1957.
SALCEDO-SANZ, S. et al. Teaching advanced features of evolutionary algorithms using japanese puzzles. IEEE Transactions on Education, v. 50, n. 2, p. 151-156, 2007(a).
SALCEDO-SANZ, S. et al. Solving japanese puzzles with heuristics. Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Games, p. 224-231, 2007(b).
SCHWANDER, P. et al. Mapping projected potential, interfacial roughness, and composition in general crystalline solids by quantitative transmission electron mi- croscopy. Physical Review Letters, v. 71, p. 4150-4153, 1993.
SMITH, K. D. Dynamic programming and board games: A survey. European Journal of Operational Research, v. 176, p. 1299–1318, 2007.
SOHN, Y.-S.; OH, K.; KIM, B. A Recognition Method of the Printed Alphabet by using Nonogram Puzzle. 2007.
STUCKMAN, J.; ZHANG, G.-Q. Mastermind is NP-complete. INFOCOMP Journal of Computer Science, v. 5, p. 25-28, 2006.
TAKAHIRO, S. The complexities of puzzles, cross sum and their another solution problems (ASP). 2001. Dissertação, Department of Information Science, University of Tokyo. 2001.
TSAI, J.-T. Solving Japanese nonograms by Taguchi-based genetic algorithm. Applied Intelligence, v. 37, n. 3, p. 405-419, 2012.
TSAI, J.-T.; CHOU, P.-Y. Solving Japanese Puzzles by Genetic Algorithms. Machine Learning and Cybernetics (ICMLC), v. 2, p. 785-788, 2011.
TSAI, J.-T.; CHOU, P.-Y.; FANG, J.-C. Learning Inteligent Genetic Algorithms Using Japanese Nonogram. IEEE Transactions on Education, v. 55, n. 2, p. 164-168, 2012.
UEDA, N.; NAGAO, T. Np-completeness Results for Nonogram via Parsimonious Reductions, 1996.
VACCARO, M.; GUEST, C. C. Planning an endgame move set for the game RISK: a comparison of search algorithms. IEEE Transactions on Evolutionary Computation, v. 9, n. 6, p. 641-652, 2005.
WANG, W-S.; CHIAGO, T-C. Solving Eternity-II puzzles with a tabu search algorithm, Proceedings of International Conference on Methaheuristics and Nature Inspired Computing, META 2010, 2010.
WHITLEY, D. A genetic a;gorithm tutorial. Statistics and Computing, v. 4, p. 65-85, 1994.
WIGGERS, W. A comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms. Proceedings of the first Twente student conference on IT , 1-6, 2004.
WIKIPEDIA. Nonogram. Acesso em 21 de Jan. 2012. Disponível em Nonogram: http://en.wikipedia.org/wiki/Nonogram.
YATO, T. On the NP-completeness of the slither link puzzle. IPSJ SIGNotes Algorithms, v. 74, p. 25-32, 2000.
YATO, T.; SETA, T. Solving Eternity-II puzzles with tabu search algorithm. Proceedings of International Conference on Metaheuristics and Nature Intired Computing , META 2010, 2010
YU, C.-H.; LEE, H.-L.; CHEN, L.-H. An efficient algorithm for solving nonograms. Applied Intelligence, v. 35, p. 18-31, 2009.
YEN, S.-J. et al. Optimization of Nonogram's Solvver by using an Efficient Algorithm. International Conference on Technologies an Applications of Artificial Intelligence , p. 444-449, 2010.