Skip to main content
SpringerLink
Log in

Analysis of Fred Horn’s Gloop Puzzle

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

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

Included in the following conference series:

  • 902 Accesses

Abstract

Gloop is a tile-based combinatorial puzzle game with a strong topological basis, in which the player is assigned a number of challenges to complete with a particular set of tiles. This paper describes the computer-based analysis of a number of representative Gloop challenges, including the computer-assisted solution of a difficult problem that had stood for over a decade.

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

Notes

  1. 1.

    To borrow a term from the board game Go.

References

  1. Horn, F.: Grote Zomerpuzzel: Doorlopende Puzzel. Natuur & Techniek, pp. 52–53, July/August 2003. (in Dutch)

    Google Scholar 

  2. Horn, F.: De Grote Zomerpuzzel: Opgelost. Natuur & Techniek, pp. 54–55, October 2003. (in Dutch)

    Google Scholar 

  3. Romeral Andrés, N.: Gloop. Nestorgames (2016). http://nestorgames.com/#gloop_detail

  4. Motzkin, T.S.: Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products. Bull. Am. Math. Soc. 54, 352–360 (1948)

    Article  MathSciNet  MATH  Google Scholar 

  5. Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: connections and complexity. Graphs Comb. 23, 195–208 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ansótegui, C., Béjar, R., Fernández, C., Mateu, C.: How hard is a commercial puzzle: the eternity II challenge. In: 2008 Conference on Artificial Intelligence Research and Development, pp. 99–108. IOS Press (2008)

    Google Scholar 

  7. Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Pearson Education, New Jersey (2009)

    MATH  Google Scholar 

  8. Browne, C., Powley, E., Whitehouse, D., Lucas, S., Cowling, P.I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of monte carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4, 1–43 (2012)

    Article  Google Scholar 

  9. Schadd, M.P.D., Winands, M.H.M., van den Herik, H.J., Chaslot, G.M.J.-B., Uiterwijk, J.W.H.M.: Single-player monte-carlo tree search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 1–12. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87608-3_1

    Chapter  Google Scholar 

  10. Lourenço, H.R., Martin, O., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, vol. 57, pp. 321–353. Kluwer Academic Publishers, Dordrecht (2003). https://doi.org/10.1007/0-306-48056-5_11

    Chapter  Google Scholar 

  11. Toulis, P.: The eternity puzzle. Technical report, Harvard University (2009)

    Google Scholar 

  12. Perlis, A.: Epigrams on programming. SIGPLAN Not. 17, 7–13 (1982)

    Article  Google Scholar 

Download references

Acknowledgments

Thanks to Fred Horn for introducing me to Puzzle 95 (aka Gloop), Néstor Romeral Andrés and Robin Barrett for Gloop-based discussions, and Frederic Maire for suggestions on improving the proof. This work was funded by a QUT Vice-Chancellor’s Research Fellowship.

Author information

Authors and Affiliations

  1. Queensland University of Technology, Gardens Point, Brisbane, 4000, Australia

    Cameron Browne

Authors
  1. Cameron Browne
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cameron Browne .

Editor information

Editors and Affiliations

  1. Department of Data Science and Knowledge Engineering, Maastricht University, Maastricht, Limburg, The Netherlands

    Mark H.M. Winands

  2. Leiden Centre of Data Science, Leiden University, Leiden, Zuid-Holland, The Netherlands

    H. Jaap van den Herik

  3. Leiden Institute of Advanced Computer Science, Leiden University, Leiden, Zuid-Holland, The Netherlands

    Walter A. Kosters

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Browne, C. (2017). Analysis of Fred Horn’s Gloop Puzzle. In: Winands, M., van den Herik, H., Kosters, W. (eds) Advances in Computer Games. ACG 2017. Lecture Notes in Computer Science(), vol 10664. Springer, Cham. https://doi.org/10.1007/978-3-319-71649-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71649-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71648-0

  • Online ISBN: 978-3-319-71649-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation