New: this game comes with the next update of the app.
Isle Hop · Tricky
Isle Hop Tricky Level 617
Exactly the map of Tricky level 617 in the app: 8×10 map, 20 islands, 25 bridges. Play it yourself right here, or open the solution and go through it bridge by bridge, each step with the reason why.
Open with starsIn the app, you open this level for free with the stars you win, in a pack of 50. Beasties Pro, a one-time purchase, opens every level at once. How Free and Pro work
- 8×10map
- 20islands
- 25bridges to build
- 35logic steps
Rows count from the top, columns from the left. Tap Next step to see the first one, and why.
All 35 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 bridge: 1–3 (row 1, column 4 → row 1, column 7). The 1 at row 1, column 4 needs every bridge its neighbours can still take.
- 2 bridges: 3–3 (row 1, column 7 → row 4, column 7). The 3 at row 1, column 7 needs every bridge its neighbours can still take.
- at least 1 bridge: 2–3 (row 2, column 1 → row 6, column 1). The 2 at row 2, column 1 can only reach its number with these bridges: the other neighbours can’t give enough.
- at least 1 bridge: 2–4 (row 2, column 8 → row 6, column 8). The 2 at row 2, column 8 can only reach its number with these bridges: the other neighbours can’t give enough.
- at most 1 bridge: 2–3 (row 4, column 5 → row 4, column 7); at most 1 bridge: 3–3 (row 4, column 7 → row 7, column 7). The 3 at row 4, column 7 has room for only one more bridge here.
- at least 1 bridge: 4–4 (row 6, column 3 → row 6, column 8). The 4 at row 6, column 8 can only reach its number with these bridges: the other neighbours can’t give enough.
- at least 1 bridge: 4–3 (row 7, column 5 → row 7, column 7). The 3 at row 7, column 7 can only reach its number with these bridges: the other neighbours can’t give enough.
- 1 bridge: 3–1 (row 7, column 7 → row 9, column 7). The 1 at row 9, column 7 needs every bridge its neighbours can still take.
- at least 1 bridge: 2–4 (row 10, column 1 → row 10, column 3). The 2 at row 10, column 1 can only reach its number with these bridges: the other neighbours can’t give enough.
- at least 1 bridge: 4–5 (row 7, column 5 → row 10, column 5); at least 1 bridge: 4–5 (row 10, column 3 → row 10, column 5); at least 1 bridge: 5–2 (row 10, column 5 → row 10, column 8). The 5 at row 10, column 5 can only reach its number with these bridges: the other neighbours can’t give enough.
- no bridge: 1–2 (row 2, column 5 → row 2, column 8). The sure bridge between the 3 at row 1, column 7 and the 3 at row 4, column 7 runs across here, and bridges never cross.
- no bridge: 2–4 (row 4, column 5 → row 7, column 5); no bridge: 3–3 (row 4, column 7 → row 7, column 7). The sure bridge between the 4 at row 6, column 3 and the 4 at row 6, column 8 runs across here, and bridges never cross.
- no bridge: 1–1 (row 8, column 1 → row 8, column 8). The sure bridge between the 4 at row 7, column 5 and the 5 at row 10, column 5 runs across here, and bridges never cross.
- 2 bridges: 2–4 (row 2, column 8 → row 6, column 8). The 2 at row 2, column 8 needs every bridge its neighbours can still take.
- 1 bridge: 2–3 (row 4, column 5 → row 4, column 7). The 3 at row 4, column 7 needs every bridge its neighbours can still take.
- 2 bridges: 4–3 (row 7, column 5 → row 7, column 7); 2 bridges: 4–5 (row 7, column 5 → row 10, column 5). The 4 at row 7, column 5 needs every bridge its neighbours can still take.
- at most 1 bridge: 2–2 (row 4, column 3 → row 4, column 5). The 2 at row 4, column 5 has room for only one more bridge here.
- at least 1 bridge: 2–4 (row 4, column 3 → row 6, column 3). The 2 at row 4, column 3 can only reach its number with these bridges: the other neighbours can’t give enough.
- no bridge: 1–2 (row 2, column 5 → row 4, 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 1, column 4.
- 1 bridge: 2–1 (row 2, column 1 → row 2, column 5). The 1 at row 2, column 5 needs every bridge its neighbours can still take.
- 1 bridge: 2–2 (row 4, column 3 → row 4, column 5). The 2 at row 4, column 5 needs every bridge its neighbours can still take.
- 1 bridge: 2–3 (row 2, column 1 → row 6, column 1). The 2 at row 2, column 1 has room for only one more bridge here.
- 1 bridge: 2–4 (row 4, column 3 → row 6, column 3). The 2 at row 4, column 3 has room for only one more bridge here.
- at least 1 bridge: 3–4 (row 6, column 1 → row 6, column 3). The 3 at row 6, column 1 can only reach its number with these bridges: the other neighbours can’t give enough.
- at most 1 bridge: 4–4 (row 6, column 3 → row 10, column 3). The 4 at row 6, column 3 has room for only one more bridge here.
- 1 bridge: 3–4 (row 6, column 1 → row 6, column 3). Suppose two bridges went here. Then, thinking on with the numbers, the 4 at row 10, column 3 could no longer get its bridges. So it has to be the other way.
- 1 bridge: 3–1 (row 6, column 1 → row 8, column 1). The 3 at row 6, column 1 needs every bridge its neighbours can still take.
- no bridge: 1–2 (row 8, column 1 → row 10, column 1). The 1 at row 8, column 1 already has all its bridges, so no more go out from it.
- 2 bridges: 2–4 (row 10, column 1 → row 10, column 3). The 2 at row 10, column 1 needs every bridge its neighbours can still take.
- 1 bridge: 4–4 (row 6, column 3 → row 6, column 8). A second 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 1, column 4.
- 1 bridge: 4–4 (row 6, column 3 → row 10, column 3). The 4 at row 6, column 3 needs every bridge its neighbours can still take.
- 1 bridge: 4–1 (row 6, column 8 → row 8, column 8). The 4 at row 6, column 8 needs every bridge its neighbours can still take.
- no bridge: 1–2 (row 8, column 8 → row 10, column 8). The 1 at row 8, column 8 already has all its bridges, so no more go out from it.
- 1 bridge: 4–5 (row 10, column 3 → row 10, column 5). The 4 at row 10, column 3 has room for only one more bridge here.
- 2 bridges: 5–2 (row 10, column 5 → row 10, column 8). The 5 at row 10, column 5 needs every bridge its neighbours can still take.
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












