The Gloop tile set represents all unique ways in which non-intersecting paths can be drawn within a square tile with two terminal points per side, and the Gloop puzzle game consists of a number of challenges to be attempted with this tile set. This paper describes the computer-based analysis of the key Gloop challenges, including the computer-assisted solution of the most difficult challenge – whether all tiles can be packed into a rectangle to form a single continuous contour – which had stood for over a decade. The resulting proof allows a simple arithmetic for the analysis of Gloop tiles, on square and other potential geometries, and demonstrates how computer analysis can inspire the solution of problems even if it does not yield those solutions itself.
ICGA Journal – IOS Press
Published: Jan 1, 2018
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera