High-performance, logic-driven game engines by Dynamic Tech World.
This repository serves as a technical showcase for interactive engines built with Vanilla JavaScript and advanced browser APIs. These are not just "games"—they are explorations in State Management, Pathfinding Algorithms, and Real-time Rendering.
| Engine | Technical Highlight | Live Access |
|---|---|---|
| AI Tic Tac Doom | Minimax Algorithm (Unbeatable AI) | Play Now |
| Maze Craze | Procedural Generation & Pathfinding | Play Now |
| Tetris Engine | Matrix Rotation & Line Cleansing Logic | Play Now |
| Sudoku | Constraint Satisfaction Algorithm | Play Now |
| Snake Loop | Collision Detection & Buffer Management | Play Now |
| Memory Card | State-Sync & Pattern Matching | Play Now |
In AI Tic Tac Doom, the core engine utilizes a recursive Minimax algorithm. The AI evaluates every possible move branch to ensure an "unbeatable" state. This demonstrates advanced tree-traversal and heuristic evaluation logic.
Maze Craze utilizes a Depth-First Search (DFS) algorithm to generate perfect mazes. The engine ensures that every generated level is mathematically solvable while maintaining randomized complexity.
For high-speed titles like Tetris and Snake, I implemented a decoupled game loop.
- Deterministic Logic: Game state updates are independent of the render frame.
- Collision Detection: Efficient coordinate-based collision systems built without heavy external libraries.
The Sudoku engine features a backtracking algorithm for both board generation and validation, ensuring that every puzzle has a unique solution.
- Engine: Pure Vanilla JavaScript (ES6+).
- Rendering: DOM-optimized manipulation & HTML5 Canvas API.
- Architecture: Object-Oriented Programming (OOP) & Functional State management.
Proprietary Software.
Copyright © 2024 Dynamic Tech World.
All rights reserved. The source code is kept private to protect Intellectual Property. You are free to play and test the live deployments via the links provided.
If you find these tools useful, consider supporting our production costs.
