Course projects · INFO-F-311 · 2024–2025
AI Algorithms
Five classic-AI mini-projects, from search to deep learning.
Python
Play: you vs the minimax AI
A competitive gem world built from my Search and Adversarial-search projects — collect more diamonds than an alpha-beta minimax agent. New maze every game.
Your turn — use the arrow keys / WASD or the buttons. Grab more diamonds than the AI.
Overview
A collection of five artificial-intelligence projects covering the breadth of a classic AI course — from uninformed and informed search through to reinforcement and machine learning.
Projects in this collection
Search
Pathfinding with uninformed & informed search (BFS, A*…).
Python
Adversarial Search
Minimax with alpha-beta pruning for two-player games.
Python
Bayesian Networks
Probabilistic reasoning and inference over Bayesian networks.
Python
Reinforcement Learning
Agents learning policies through reward (Q-learning).
Python
Machine Learning
An autoencoder built and trained from scratch.
Python · NumPy