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












