consistency
commited
commit
e5f9f416fb80f899d709025ce1b558d945a34be7
| ... | ... | @@ -1,15 +1,18 @@ |
| 1 | 1 |  |
| 2 | 2 | [OneTouch](https://play.fancade.com/602F3DC96E83ACF0) by u ndefined is a game where you need to make all lines green in 1 hold by going into different nodes without getting stuck to win. |
| 3 | 3 | |
| 4 | # How to Play |
|
| 4 | ## How to Play |
|
| 5 | ||
| 5 | 6 | Tap a node to start drawing, drag to another node with a blue line connection to connect it, if the connection doesnt exist or is already green, or doesn't correctly match the triangles direction, nothing happens. A triangle indicates you need to go to the node specifically from base 1st or it wont let you access. If you let go, all green lines turn blue. Make all lines green to win. |
| 6 | 7 | |
| 7 | # Strategy |
|
| 8 | Note the amount of neighbors a node has in a random valid solution, if you play with it you'll notice that either 0 or 2 nodes have odd amounts of neighbors in a possible puzzle, and the ones with 2 odd nodes are always the starts and ends of the puzzle, you can use this fact to identify where to start, and guessing where to go is mostly enough to beat those puzzles, use a little logic and note the triangles as well in case of getting stuck, this node observation is [actualy a real graph theory observation](https://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg) |
|
| 8 | ## Strategy |
|
| 9 | ||
| 10 | Note the amount of neighbors a node has in a random valid solution. If you play with it, you'll notice that either 0 or 2 nodes have odd amounts of neighbors in a possible puzzle, and the levels with 2 odd nodes are always the starts and ends of the puzzle. You can use this fact to identify where to start, and guessing where to go is mostly enough to beat those puzzles, using a little logic. Also note the triangles as well, in case of getting stuck. |
|
| 9 | 11 | |
| 10 | # Walkthrough |
|
| 11 | [Levels 1-20](https://www.youtube.com/watch?v=kymySD06Qi4) |
|
| 12 | This node observation is [actualy a real graph theory observation](https://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg) |
|
| 12 | 13 | |
| 13 | [Levels 21-42](https://www.youtube.com/watch?v=72rbUqftVYg) |
|
| 14 | ## Walkthrough |
|
| 14 | 15 | |
| 15 | [Levels 43-50](https://www.youtube.com/watch?v=55ElsYC3PwI) |
|
| ... | ... | \ No newline at end of file |
| 0 | - [Levels 1-20](https://www.youtube.com/watch?v=kymySD06Qi4) |
|
| 1 | - [Levels 21-42](https://www.youtube.com/watch?v=72rbUqftVYg) |
|
| 2 | - [Levels 43-50](https://www.youtube.com/watch?v=55ElsYC3PwI) |
|
| ... | ... | \ No newline at end of file |