A free maze game — play it in your browser, no install. An interactive visualization of maze-based shortest path algorithms with support for Dijkstra, Bellman-Ford, Floyd-Warshall, BFS, and DFS. Set start/end points, place walls, and observe how classic graph algorithms find paths dynamically on a 10x10 grid maze.
Vote and save it — free account with email or sign in with GitHub
Made this, @EpitomeZied? See how many people played it → or use email
📅 Three new games every day, no account needed · Play today’s three →
GitHub may ask you to sign in, then to let VibeCruiser “Verify your GitHub identity” and “Act on your behalf”. We only read your profile and email, and never post anything.
No account needed to save ♥ or react 🔥: they’re under the game. Or vote with email.
Open the live demo Source on GitHubThis project is an interactive web application designed to visually demonstrate key graph algorithms on a maze grid. Users can dynamically set start and end points, build walls as obstacles, and run various pathfinding algorithms to see how they explore and find paths.
Maze Interface: 10x10 grid where users can add start, end, and wall cells interactively. Dijkstra: Efficient shortest path for graphs with non-negative weights. Bellman-Ford: Handles graphs with negative weight edges and detects cycles. Floyd-Warshall: Computes shortest paths between all pairs of vertices.
Built something like this? Submit your vibe — free account, takes a minute. How listing works.
Claim it: create a free account, then press CLAIM THIS in the cruiser. Put the badge below in your README or on your demo page first; that link is how we know it's yours.
Your project is on the cruise, loaded live from your own site. Put the badge in your README or on the demo page: it shows your live play count, it links back to this page, and everyone who lands here is one click from running the real thing.