🧠 Implement AI search algorithms and heuristics for Pacman using UC Berkeley’s framework to solve grid-based pathfinding challenges efficiently.

Read, write and manipulate dfs0, dfs1, dfs2, dfs3, dfsu and mesh files.

Data Structure and Algorithm

Interactive application for generating and solving mazes using AI algorithms (BFS, DFS, A*), developed as part of the Software Engineering course.

Algorithms and data structures implemented in Python

Python simulation of cascading failures in financial networks using BFS/DFS and Matplotlib visualisation

An implementation of the classic "Missionaries and Cannibals" problem using uninformed search algorithms (BFS and DFS) in Python. Includes a detailed performance and memory usage analysis.

Pygame visualizer comparing DFS, BFS, and A* on grid mazes.

BFS, DFS, and A* algorithms to solve the 8-puzzle problem with step-by-step visualization — University of Pisa, AI Fundamentals

Retro maze game in Python using Pyxel: procedurally generated levels, 3 difficulty levels, real-time timer, and saved high scores.

Implementing Various uniformed Search methods using python, matplotlib, networkx as i learn them. It's a virtual AI lab notebook!

Visual implementation of BFS, DFS, and A* pathfinding algorithms — built on mobile with Python

AI Game Arena is a collection of AI-powered mini games.

A structured Python learning repo covering basics, OOP, error handling, algorithms (BFS/DFS), and a real-world sales data analysis project.

WNBA DFS lineup optimizer — XGBoost predicts fantasy points, PuLP solves salary-constrained rosters, Streamlit dashboard for daily contest prep. Supports DraftKings, FanDuel, and Yahoo with Bayesian cold-start for rookies and full MLflow/DVC/S3 tracking.

Interactive Svelte app for pentaminoes with solver. Animate search. Also a animation of a DFS search using the pentamino solver as example

🎮 经典水管工逻辑益智游戏 | Python + tkinter | 含关卡生成与三层求解算法动画演示 | BFS + DFS + 演绎推理

Depth-First Search (DFS) solver for the 15-puzzle problem with depth limiting and OOP design -- Python

This solver includes 2 versions: Classic (1 remaining peg in center hole), Max-Peg (play until no valid moves remained)

computer science topics in python