Learn the rule. Play the idea.
AlgoRift is an interactive algorithm mini-game academy. Each concept has its own game board and interaction model, with immediate feedback and a guided learning path from beginner search techniques to dynamic programming. Every mini-game is playable immediately, so students can follow the suggested order or jump straight to the topic they want to practice.
- Signal Scanner - Binary Search: repeatedly cut a sorted search range.
- Packet Conveyor - Bubble Sort: keep or swap the active neighboring pair.
- Memory Elevator - Stacks: load cargo, then dispatch it using LIFO order.
- Branch Finder - Binary Search Trees: navigate comparisons toward a target.
- Queue Rescue - BFS: process graph nodes from the front of a live queue.
- Shortest Route - Dijkstra: lock the cheapest node on the current frontier.
- Interval Planner - Greedy: build a compatible schedule by earliest finish.
- Memo Forge - Dynamic Programming: construct Fibonacci values from cached cells.
- Sorting Arsenal: practice insertion, selection, exchange, merge, quick, and heap sort.
- Depth Dive - DFS: explore deeply and backtrack with an explicit stack.
- Grid Architect - MST: build a minimum spanning tree with Kruskal's rule.
- Code Compressor - Huffman: merge minimum frequencies into a prefix tree.
Every incorrect move explains the relevant rule without revealing the entire solution. All games remain available at all times.
AlgoRift includes interactive coverage of the COE428 topics shown in the course resources: insertion, merge, heap, selection, exchange, quick, and bubble sort; breadth-first search; depth-first search; Dijkstra's algorithm; minimum spanning trees; and Huffman compression.
- Next.js 16 App Router
- React 19 and TypeScript
- Static client-side gameplay
- Vercel
npm install
npm run devNo database or environment variables are required.
npm run lint
npx tsc --noEmit
npm run buildDesigned and developed by Immanuel Gnanaseelan.
Released under the MIT License.