You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A desktop AI project that visualizes pathfinding algorithms (A*, Dijkstra, Greedy Best-First) and adversarial search (Alpha-Beta Minimax) on a grid model of Islamabad, with traffic simulation and multi-agent priority routing.
A custom made high-performance Chess Engine created entirely from scratch in modern C++, supporting UCI and terminal plays, O(1) memory hashing, and highly optimized game tree search algorithms along with Tapered evaluation leading to a signifcant rise in performance.