← Back to Base

Games Lab

Five interactive simulations demonstrating classical AI decision-making algorithms and search strategies.

What these simulations demonstrate:

  • Chess & Connect 4: Adversarial search using Minimax with Alpha-Beta pruning to optimize move trees.
  • 2048: Probabilistic decision-making using the Expectimax algorithm.
  • Snake: Real-time shortest path finding using Breadth-First Search (BFS).
  • Minesweeper: Logical deduction via constraint propagation and solving.

These implementations showcase fundamental AI engineering concepts, bridging the gap between theoretical computer science and interactive, browser-based applications.

Chess

Chess Engine

Strategy
  • ✓ Play the computer
  • ✓ Watch Auto-Play
  • ✓ Adjust Difficulty
Connect 4

Connect 4

Adversarial
  • ✓ Play the computer
  • ✓ Watch Auto-Play
  • ✓ Zero-Sum Game
2048

2048

Probabilistic
  • ✓ Watch Auto-Play
  • ✓ Grid Logic
  • ✓ High Scores
Snake

Snake

Pathfinding
  • ✓ Watch Auto-Play
  • ✓ Real-Time Pathing
  • ✓ Collision Avoidance
Minesweeper

Minesweeper

Logic
  • ✓ Play the computer
  • ✓ Watch Auto-Play
  • ✓ Safe Sweeping

Contact Ahmad

[ COMM-LINK: SECURE // ESTABLISHED ]

Leave a message. If I'm offline, I'll receive it instantly by email.