Diagonal chess sliding puzzle — slide from S to G with bishop moves
You get an N×N grid with walls (darker cells), a green S (start) and a golden G (goal). Draw a path from S to G using only bishop moves — slide any number of cells diagonally in one of 4 directions. Walls block your path. Each puzzle has a unique shortest path. Find it in the minimum number of moves for 3 stars!
⭐ Beginner (5×5) → ⭐⭐ Easy (6×6) → ⭐⭐⭐ Medium (7×7) → ⭐⭐⭐⭐ Hard (8×8) → ⭐⭐⭐⭐⭐ Expert (9×9)
SELECT LEVEL
L1
⏱0:00
↦0
LEVEL COMPLETE!
★★★
Solved in 0s
0 moves · optimal
Click extend path (bishop moves only)U undoEnter checkR restartH hint
How To Play Bishop Path
You get an N×N grid with walls (darker filled cells are impassable), a green S marker (start), and a golden G marker (goal).
Your task is to draw a path from S to G using only bishop moves: slide any number of cells diagonally in one of 4 directions (NW, NE, SW, SE) — like a chess bishop, but the path is built step-by-step.
Tap the green S marker to begin. The path starts there.
Tap any cell that's diagonally reachable (no wall in between) to extend the path.
You cannot step on walls (darker filled cells) or revisit a cell.
Reach the G marker to win. Each puzzle has a unique shortest path — solve in the minimum number of moves for 3 stars!
Controls:
Tap / click — extend the path to a bishop-reachable cell.
U / Backspace — undo last step.
Enter — check whether your path reaches the goal.
R — restart the level.
H — extend along the optimal path (3 hints per level).
Esc — back to level select.
Scoring: 3 stars for finishing in the optimal number of moves with no hints. Sub-optimal paths still complete the level but with fewer stars.