New: this game comes with the next update of the app.
Isle Hop · Devilish
Isle Hop Devilish Level 43
Exactly the map of Devilish level 43 in the app: 9×11 map, 23 islands, 31 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
- 23islands
- 31bridges to build
- 47logic steps
Rows count from the top, columns from the left. Tap Next step to see the first one, and why.
All 47 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: 2–1 (row 1, column 5 → row 1, column 8). The 1 at row 1, column 8 needs every bridge its neighbours can still take.
- at least 1 bridge: 2–4 (row 2, column 7 → row 5, column 7). The 2 at row 2, column 7 can only reach its number with these bridges: the other neighbours can’t give enough.
- at least 1 bridge: 2–3 (row 3, column 3 → row 3, column 5). The 2 at row 3, column 3 can only reach its number with these bridges: the other neighbours can’t give enough.
- at least 1 bridge: 2–2 (row 6, column 1 → row 11, column 1). The 2 at row 6, column 1 can only reach its number with these bridges: the other neighbours can’t give enough.
- at least 1 bridge: 3–5 (row 5, column 2 → row 7, column 2); at least 1 bridge: 5–2 (row 7, column 2 → row 7, column 4); at least 1 bridge: 5–3 (row 7, column 2 → row 9, column 2). The 5 at row 7, column 2 can only reach its number with these bridges: the other neighbours can’t give enough.
- at most 1 bridge: 2–4 (row 7, column 4 → row 7, column 7); at most 1 bridge: 2–3 (row 7, column 4 → row 11, column 4). The 2 at row 7, column 4 has room for only one more bridge here.
- at least 1 bridge: 3–3 (row 9, column 2 → row 9, column 5). The 3 at row 9, column 2 can only reach its number with these bridges: the other neighbours can’t give enough.
- at least 1 bridge: 5–3 (row 5, column 5 → row 9, column 5). The 3 at row 9, column 5 can only reach its number with these bridges: the other neighbours can’t give enough.
- at most 1 bridge: 2–3 (row 11, column 1 → row 11, column 4). The 2 at row 11, column 1 has room for only one more bridge here.
- at least 1 bridge: 3–4 (row 11, column 4 → row 11, column 7). The 3 at row 11, column 4 can only reach its number with these bridges: the other neighbours can’t give enough.
- no bridge: 3–2 (row 3, column 5 → row 3, column 9). The sure bridge between the 2 at row 2, column 7 and the 4 at row 5, column 7 runs across here, and bridges never cross.
- no bridge: 1–2 (row 2, column 4 → row 7, column 4). The sure bridge between the 2 at row 3, column 3 and the 3 at row 3, column 5 runs across here, and bridges never cross.
- no bridge: 2–4 (row 7, column 4 → row 7, column 7). The sure bridge between the 5 at row 5, column 5 and the 3 at row 9, column 5 runs across here, and bridges never cross.
- no bridge: 2–3 (row 7, column 4 → row 11, column 4). The sure bridge between the 3 at row 9, column 2 and the 3 at row 9, column 5 runs across here, and bridges never cross.
- at most 1 bridge: 2–2 (row 1, column 2 → row 1, column 5); at most 1 bridge: 2–3 (row 1, column 5 → row 3, column 5). The 2 at row 1, column 5 has room for only one more bridge here.
- 1 bridge: 1–2 (row 2, column 4 → row 2, column 7). The 1 at row 2, column 4 needs every bridge its neighbours can still take.
- 1 bridge: 2–4 (row 2, column 7 → row 5, column 7). The 2 at row 2, column 7 has room for only one more bridge here.
- 2 bridges: 2–4 (row 3, column 9 → row 7, column 9). The 2 at row 3, column 9 needs every bridge its neighbours can still take.
- at least 1 bridge: 5–4 (row 5, column 5 → row 5, column 7); at least 1 bridge: 4–4 (row 5, column 7 → row 7, column 7). The 4 at row 5, column 7 can only reach its number with these bridges: the other neighbours can’t give enough.
- 2 bridges: 5–2 (row 7, column 2 → row 7, column 4). The 2 at row 7, column 4 needs every bridge its neighbours can still take.
- 1 bridge: 2–3 (row 11, column 1 → row 11, column 4); 2 bridges: 3–4 (row 11, column 4 → row 11, column 7). The 3 at row 11, column 4 needs every bridge its neighbours can still take.
- no bridge: 2–3 (row 1, column 5 → row 3, column 5). The sure bridge between the 1 at row 2, column 4 and the 2 at row 2, column 7 runs across here, and bridges never cross.
- at least 1 bridge: 2–3 (row 1, column 2 → row 5, column 2). The 2 at row 1, column 2 can only reach its number with these bridges: the other neighbours can’t give enough.
- 1 bridge: 2–2 (row 1, column 2 → row 1, column 5). The 2 at row 1, column 5 needs every bridge its neighbours can still take.
- at least 1 bridge: 3–5 (row 3, column 5 → row 5, column 5). The 3 at row 3, column 5 can only reach its number with these bridges: the other neighbours can’t give enough.
- at most 1 bridge: 3–5 (row 5, column 2 → row 5, column 5). The 3 at row 5, column 2 has room for only one more bridge here.
- 1 bridge: 2–2 (row 6, column 1 → row 11, column 1). The 2 at row 11, column 1 has room for only one more bridge here.
- no bridge: 1–2 (row 3, column 1 → row 3, column 3). The sure bridge between the 2 at row 1, column 2 and the 3 at row 5, column 2 runs across here, and bridges never cross.
- 1 bridge: 2–3 (row 1, column 2 → row 5, column 2). The 2 at row 1, column 2 has room for only one more bridge here.
- 1 bridge: 1–2 (row 3, column 1 → row 6, column 1). The 1 at row 3, column 1 needs every bridge its neighbours can still take.
- 2 bridges: 2–3 (row 3, column 3 → row 3, column 5). The 2 at row 3, column 3 needs every bridge its neighbours can still take.
- 1 bridge: 3–5 (row 3, column 5 → row 5, column 5). The 3 at row 3, column 5 has room for only one more bridge here.
- 1 bridge: 3–5 (row 5, column 2 → row 5, column 5). Suppose no bridge went here. Then, thinking on with the numbers, the 3 at row 9, column 5 could no longer get its bridges. So it has to be the other way.
- 1 bridge: 3–5 (row 5, column 2 → row 7, column 2). The 3 at row 5, column 2 has room for only one more bridge here.
- 2 bridges: 5–3 (row 7, column 2 → row 9, column 2). The 5 at row 7, column 2 needs every bridge its neighbours can still take.
- 1 bridge: 3–3 (row 9, column 2 → row 9, column 5). The 3 at row 9, column 2 has room for only one more bridge here.
- 2 bridges: 5–3 (row 5, column 5 → row 9, column 5). The 3 at row 9, column 5 needs every bridge its neighbours can still take.
- 1 bridge: 5–4 (row 5, column 5 → row 5, column 7). The 5 at row 5, column 5 has room for only one more bridge here.
- 2 bridges: 4–4 (row 5, column 7 → row 7, column 7). The 4 at row 5, column 7 needs every bridge its neighbours can still take.
- at least 1 bridge: 4–4 (row 7, column 7 → row 7, column 9). Suppose no bridge went here. Then, thinking on, the group with the 2 at row 1, column 2 would close itself off. So it has to be the other way.
- at most 1 bridge: 4–4 (row 7, column 7 → row 11, column 7). The 4 at row 7, column 7 has room for only one more bridge here.
- at most 1 bridge: 4–2 (row 7, column 9 → row 11, column 9). The 4 at row 7, column 9 has room for only one more bridge here.
- at least 1 bridge: 4–2 (row 11, column 7 → row 11, column 9). The 4 at row 11, column 7 can only reach its number with these bridges: the other neighbours can’t give enough.
- 1 bridge: 4–4 (row 7, column 7 → row 7, column 9). 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 2.
- 1 bridge: 4–4 (row 7, column 7 → row 11, column 7). The 4 at row 7, column 7 needs every bridge its neighbours can still take.
- 1 bridge: 4–2 (row 7, column 9 → row 11, column 9). The 4 at row 7, column 9 needs every bridge its neighbours can still take.
- 1 bridge: 4–2 (row 11, column 7 → row 11, column 9). The 4 at row 11, column 7 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












