Tour puzzle
A tour puzzle is a puzzle in which the player travels around a board (usually but not necessarily two-dimensional) using a token which represents a character. Maze puzzles are often of this type.
| Part of a series on |
| Puzzles |
|---|
 |
Sometimes the player has more than one token with which to travel. Sometimes certain objects have to be found or retrieved on the way. In the case of large hedge mazes, the player makes the trip themselves instead of a token.
Often there is a given start and finish position for the player's token. Some tour puzzles demand that certain points on the board have to be visited on the way.
Examples of tour puzzles
gollark: Or look at how the repost detection bots do it.
gollark: Really? I'll have to look into this then.
gollark: There are probably freely available machine-learning-y things for it, I guess? And you could definitely read some of the *text* in them.
gollark: Unfortunately the "comparing features" bit is probably extremely hard.
gollark: The annoying thing is that I'm pretty sure I've got duplicates, but I can't *check* because memes tend to get randomly recompressed and cropped and downscaled and whatnot, so `fdupes` doesn't work on them.
References
- Vourkas, Ioannis; Stathis, Dimitrios; Sirakoulis, Georgios (2015). "Massively Parallel Analog Computing: Ariadne's Thread Was Made of Memristors". IEEE Transactions on Emerging Topics in Computing: 1. doi:10.1109/TETC.2015.2420353.
- Andersson, Daniel (31 July 2009). Perfect-Information Games with Cycles (PDF) (PhD). Aarhus University. Retrieved 29 August 2018.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.