New: this game comes with the next update of the app.

Isle Hop · Tricky

Isle Hop Tricky Level 51

Exactly the map of Tricky level 51 in the app: 8×10 map, 21 islands, 29 bridges. Play it yourself right here, or open the solution and go through it bridge by bridge, each step with the reason why.

  • 8×10map
  • 21islands
  • 29bridges to build
  • 31logic steps
Play it yourselfJoin every island.
21 islands to go

Tap an island, then a neighbour to build a bridge. Tap the bridge to remove it.

SolutionSpoiler

Rows count from the top, columns from the left. Tap Next step to see the first one, and why.

0 / 31Empty map

All 31 steps as a list

Rows count from the top, columns from the left. Each line is one step of the solution and why it holds.

  1. 2 bridges: 3–4 (row 1, column 5 → row 1, column 8); 2 bridges: 4–4 (row 1, column 8 → row 3, column 8). The 4 at row 1, column 8 needs every bridge its neighbours can still take.
  2. 2 bridges: 3–4 (row 2, column 3 → row 2, column 7); 1 bridge: 3–1 (row 2, column 3 → row 5, column 3). The 3 at row 2, column 3 needs every bridge its neighbours can still take.
  3. 2 bridges: 4–4 (row 2, column 7 → row 7, column 7). The 4 at row 2, column 7 needs every bridge its neighbours can still take.
  4. 2 bridges: 3–2 (row 3, column 6 → row 6, column 6). The 2 at row 6, column 6 needs every bridge its neighbours can still take.
  5. at least 1 bridge: 5–4 (row 7, column 4 → row 7, column 7). The 4 at row 7, column 7 can only reach its number with these bridges: the other neighbours can’t give enough.
  6. at least 1 bridge: 4–4 (row 3, column 8 → row 8, column 8); at least 1 bridge: 4–2 (row 8, column 8 → row 10, column 8). The 4 at row 8, column 8 can only reach its number with these bridges: the other neighbours can’t give enough.
  7. no bridge: 3–1 (row 1, column 5 → row 8, column 5). The sure bridge between the 3 at row 2, column 3 and the 4 at row 2, column 7 runs across here, and bridges never cross.
  8. no bridge: 3–2 (row 3, column 1 → row 3, column 4). The sure bridge between the 3 at row 2, column 3 and the 1 at row 5, column 3 runs across here, and bridges never cross.
  9. no bridge: 3–4 (row 3, column 6 → row 3, column 8). The sure bridge between the 4 at row 2, column 7 and the 4 at row 7, column 7 runs across here, and bridges never cross.
  10. 1 bridge: 2–3 (row 1, column 1 → row 1, column 5). The 3 at row 1, column 5 can only reach its number with these bridges: the other neighbours can’t give enough.
  11. at least 1 bridge: 2–3 (row 1, column 1 → row 3, column 1); at least 1 bridge: 3–4 (row 3, column 1 → row 7, column 1). The 3 at row 3, column 1 can only reach its number with these bridges: the other neighbours can’t give enough.
  12. 1 bridge: 2–3 (row 3, column 4 → row 3, column 6). The 3 at row 3, column 6 can only reach its number with these bridges: the other neighbours can’t give enough.
  13. 2 bridges: 4–4 (row 3, column 8 → row 8, column 8). The 4 at row 3, column 8 needs every bridge its neighbours can still take.
  14. 1 bridge: 2–3 (row 1, column 1 → row 3, column 1). The 2 at row 1, column 1 has room for only one more bridge here.
  15. 2 bridges: 3–4 (row 3, column 1 → row 7, column 1). The 3 at row 3, column 1 needs every bridge its neighbours can still take.
  16. 1 bridge: 2–5 (row 3, column 4 → row 7, column 4). The 2 at row 3, column 4 can only reach its number with these bridges: the other neighbours can’t give enough.
  17. no bridge: 1–1 (row 8, column 5 → row 10, column 5). A bridge here would close off a group: its islands would all be full but joined to nothing else. That group includes the 1 at row 8, column 5.
  18. 1 bridge: 1–4 (row 8, column 5 → row 8, column 8). The 1 at row 8, column 5 needs every bridge its neighbours can still take.
  19. 1 bridge: 4–2 (row 8, column 8 → row 10, column 8). The 4 at row 8, column 8 has room for only one more bridge here.
  20. 1 bridge: 1–2 (row 10, column 5 → row 10, column 8). The 1 at row 10, column 5 needs every bridge its neighbours can still take.
  21. no bridge: 4–1 (row 7, column 7 → row 9, column 7). The sure bridge between the 1 at row 8, column 5 and the 4 at row 8, column 8 runs across here, and bridges never cross.
  22. 2 bridges: 5–4 (row 7, column 4 → row 7, column 7). The 4 at row 7, column 7 needs every bridge its neighbours can still take.
  23. 1 bridge: 3–1 (row 9, column 4 → row 9, column 7). The 1 at row 9, column 7 needs every bridge its neighbours can still take.
  24. at least 1 bridge: 4–5 (row 7, column 1 → row 7, column 4). Suppose no bridge went here. Then, thinking on, the group with the 2 at row 1, column 1 would close itself off. So it has to be the other way.
  25. at most 1 bridge: 4–2 (row 7, column 1 → row 9, column 1). The 4 at row 7, column 1 has room for only one more bridge here.
  26. at most 1 bridge: 5–3 (row 7, column 4 → row 9, column 4). The 5 at row 7, column 4 has room for only one more bridge here.
  27. at least 1 bridge: 2–3 (row 9, column 1 → row 9, column 4). The 2 at row 9, column 1 can only reach its number with these bridges: the other neighbours can’t give enough.
  28. 1 bridge: 4–5 (row 7, column 1 → row 7, column 4). A second bridge here would close off a group: its islands would all be full but joined to nothing else. That group includes the 2 at row 1, column 1.
  29. 1 bridge: 4–2 (row 7, column 1 → row 9, column 1). The 4 at row 7, column 1 needs every bridge its neighbours can still take.
  30. 1 bridge: 5–3 (row 7, column 4 → row 9, column 4). The 5 at row 7, column 4 needs every bridge its neighbours can still take.
  31. 1 bridge: 2–3 (row 9, column 1 → row 9, column 4). The 2 at row 9, column 1 has room for only one more bridge here.

Every player gets the same levels in the same order, so this map matches your app. Every Isle Hop level has exactly one solution, and you can always reach it by logic, without guessing. We checked all of them with our own solver. How to play Isle Hop