Skip to main content
SpringerLink
Log in

On Efficiency of Fully Probing Mechanisms in Nonogram Solving Algorithm

  • Conference paper
  • First Online:
Advances in Computer Games (ACG 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12516))

Included in the following conference series:

  • 428 Accesses

Abstract

Fully probing plays an important role in the nonogram solving algorithm developed by Wu et al., whose implementation, named LalaFrogKK, has won several nonogram tournaments since 2011. Different fully probing methods affect the overall nonogram solving performance greatly as shown in previous studies. In this paper, we explore fully probing efficiency from different aspects and evaluate its impact on the performance of solving an entire nonogram puzzle. In the exploration, we found several critical factors influencing fully probing efficiency greatly, i.e. re-probing policy, probing sequence, and computational overhead. Taking these critical factors in account, we developed several new fully probing mechanisms to improve nonogram solving performance. Experimental results based on the puzzles of previous nonogram tournaments show that our new fully probing methods have the potential to improve the speed of solving nonogram puzzles significantly.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Batenburg, K.J.: A network flow algorithm for reconstructing binary images from dis- crete X-rays. J. Math. Imag. Vis. 27(2), 175–191 (2007)

    Article  MathSciNet  Google Scholar 

  2. Batenburg, K.J., Henstra, S., Kosters, W.A., Palenstijn, W.J.: Constructing simple nonograms of varying difficulty. Pure Math. Appl. 20, 1–15 (2009)

    MathSciNet  MATH  Google Scholar 

  3. Batenburg, K.J., Kosters, W.A.: Solving nonograms by combining relaxations. Pattern Recogn. 42(8), 1672–1683 (2009)

    Article  Google Scholar 

  4. Bosch, R.A.: Painting by numbers. Optima 65, 16–17 (2001)

    Google Scholar 

  5. Chen, L.P., Huang, K.C.: Solving nonogram puzzles by using group-based fully probing. Comput. Games Assoc. J. 40(4), 387–396 (2018)

    Google Scholar 

  6. Chen, L.P., Hung, C.Y., Liu, Y.C.: A new simplified line solver for nonogram puzzle games. In: TCGA Computer Game Workshop (TCGA2017) (2017)

    Google Scholar 

  7. Chen, Y.C., Lin, S.S.: A fast nonogram solver that won the TAAI 2017 and ICGA 2018 tournaments. Comput. Games Assoc. J. 1–13 (2019, pre-press)

    Google Scholar 

  8. Faase, F.: Nonogram to exact cover, 31 March 2018 (2009). http://www.iwriteiam.nl/D0906.html#28

  9. Huang, K.C., Yeh, J.J., Huang, W.C., Guo, Y.R.: Exploring effects of fully probing sequence on solving nonogram puzzles. Comput. Games Assoc. J. 40(4), 397–405 (2018)

    Google Scholar 

  10. Jing, M.Q.: Solving Japanese puzzles with logical rules and depth first search algorithm. In: International Conference on Machine Learning and Cybernetics, pp. 2962–2967 (2009)

    Google Scholar 

  11. Knuth, D.E.: Dancing links. In: Millennial Perspectives in Computer Science: the Oxford-Microsoft Symposium in Honour of Sir Tony Hoare (Cornerstones of Computing), Basingstoke, U.K., pp. 187–214. Palgrave (1999)

    Google Scholar 

  12. Lin, H.H., Sun, D.J., Wu, I.C., Yen, S.J.: The 2011 TAAI computer-game tournaments. Comput. Games Assoc. J. 34(1), 51–54 (2011)

    Google Scholar 

  13. LalaFrogKK, 11 May 2019 (2015). http://java.csie.nctu.edu.tw/~icwu/aigames/LalaFrogKK.html

  14. Nonogram: Wikipedia, the free encyclopedia, 11 May 2019 (2017). http://en.wikipedia.org/wiki/Nonogram

  15. Olšák, M., Olšák, P.: Griddlers solver, 11 May 2019 (2003). http://www.olsak.net/grid.html#English

  16. Simpson, S.: Nonogram solver, 11 May 2019. http://www.lancaster.ac.uk/~simpsons/software/pkg-nonowimp.htmlz.en-GB

  17. Tsai, J.: Solving Japanese nonograms by taguchi-based genetic algorithm. Appl. Intell. 37(3), 405–419 (2012)

    Article  Google Scholar 

  18. Tsai, J., Chou, P.: Solving Japanese puzzles by genetic algorithms. In: International Conference on Machine Learning and Cybernetics, pp. 785–788 (2011)

    Google Scholar 

  19. Tsai, J., Chou, P., Fang, J.: Learning intelligent genetic algorithms using Japanese nonograms. IEEE Trans. Educ. 55(2), 164–168 (2012)

    Article  Google Scholar 

  20. Ueda, N., Nagao, T.: NP-completeness results for nonogram via parsimonious reductions. Tech. rep. TR96-0008, Department Computer Science, Tokyo Institute Technology, Tokyo, Japan (1996)

    Google Scholar 

  21. Wiggers, W.A.: A comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms. In: Twenty Student Conference IT, pp. 1–6 (2004)

    Google Scholar 

  22. Wolter, J.: The ‘Pbnsolve’ paint-by-number puzzle solver, 11 May 2019 (2012). http://webpbn.com/pbnsolve.html

  23. Wu, I.C., et al.: An efficient approach to solving nonograms. IEEE Trans. Comput. Intell. AI Game 5(3), 251–264 (2013)

    Article  Google Scholar 

  24. Yu, C.H., Lee, H.L., Chen, L.H.: An efficient algorithm for solving nonograms. Appl. Intell. 35(1), 18–31 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Taichung University of Education, No. 140, Minsheng Road, West District, Taichung, 40306, Taiwan

    Yan-Rong Guo, Wei-Chiao Huang, Jia-Jun Yeh & Kuo-Chan Huang

  2. National Center for High-Performance Computing, Hsinchu, Taiwan

    Hsi-Ya Chang

  3. Tunghai University, Taichung, Taiwan

    Lung-Pin Chen

Authors
  1. Yan-Rong Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei-Chiao Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jia-Jun Yeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hsi-Ya Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Lung-Pin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Kuo-Chan Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kuo-Chan Huang .

Editor information

Editors and Affiliations

  1. Université Paris-Dauphine, Paris, France

    Tristan Cazenave

  2. Leiden University, The Hague, The Netherlands

    Jaap van den Herik

  3. The University of New South Wales, Sydney, NSW, Australia

    Abdallah Saffidine

  4. National Chiao-Tung University, Hsin-Chu, Taiwan

    I-Chen Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Guo, YR., Huang, WC., Yeh, JJ., Chang, HY., Chen, LP., Huang, KC. (2020). On Efficiency of Fully Probing Mechanisms in Nonogram Solving Algorithm. In: Cazenave, T., van den Herik, J., Saffidine, A., Wu, IC. (eds) Advances in Computer Games. ACG 2019. Lecture Notes in Computer Science(), vol 12516. Springer, Cham. https://doi.org/10.1007/978-3-030-65883-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-65883-0_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-65882-3

  • Online ISBN: 978-3-030-65883-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation