2D Pac-Man game benchmarking Breadth-First Search (BFS) and A* Search pathfinding algorithms for Ghost AI. Built with Python & Pygame.
-
Updated
Nov 17, 2026 - Python
2D Pac-Man game benchmarking Breadth-First Search (BFS) and A* Search pathfinding algorithms for Ghost AI. Built with Python & Pygame.
A benchmarking framework to evaluate particle tracking algorihtms of different architectures.
Machine Learning Algorithm Benchmark
Python implementations of fundamental image processing algorithms, including Prokudin-Gorskii plate alignment, exact histogram matching, selective color manipulation, and vectorized blur benchmarking.
Simulation-first 2D autonomous mobile robot navigation framework with A* planning, DWA local obstacle avoidance, EKF sensor fusion, and authentic TUM RGB-D mapping.
A Python, Tkinter visualizer to generate mazes and benchmark the execution time of various pathfinding based on algorithms.
An interactive numerical analysis dashboard built from scratch to benchmark root-finding algorithms (Bisection, Newton, Secant, Fixed-Point) with live convergence and performance plotting
To associate your repository with the algorithm-benchmarking topic, visit your repo's landing page and select "manage topics."