Untangle: Difference between revisions
(→Impossibility of Level 28: Fixed typo) Tags: Mobile edit Mobile web edit |
(Added notes) Tags: Mobile edit Mobile web edit |
||
| Line 12: | Line 12: | ||
The goal is to have all of the lines green, or in other words, all of them being untangled. | The goal is to have all of the lines green, or in other words, all of them being untangled. | ||
== | == Notes == | ||
Level 28 is proven impossible as a direct consequence of [https://en.m.wikipedia.org/wiki/Kuratowski%27s_theorem Kuratowski's theorem]. The subgraph <code>K_{3,3}</code> can be found in that level. | * Levels 21-28 are not present on the Quest | ||
* Level 28 is proven impossible as a direct consequence of [https://en.m.wikipedia.org/wiki/Kuratowski%27s_theorem Kuratowski's theorem]. The subgraph <code>K_{3,3}</code> can be found in that level. | |||
[[Category:Quest games]] | [[Category:Quest games]] | ||
[[Category:Games]] | [[Category:Games]] | ||
Revision as of 06:57, 8 August 2025
Untangle
| Title | Untangle |
| Author | Tzomby |
| GUID | 5E03DC7EA1C9CF6E |
Untangle by Tzomby is a puzzle game where you must resolve a series of nodes so that none of the connections cross over each other.
Gameplay
In this game, the player must attempt to drag the closest node to untangle the lines. Red lines indicate tangled lines, while green lines indicate resolved/untangled lines. The goal is to have all of the lines green, or in other words, all of them being untangled.
Notes
- Levels 21-28 are not present on the Quest
- Level 28 is proven impossible as a direct consequence of Kuratowski's theorem. The subgraph
K_{3,3}can be found in that level.