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
Implementing a Tic-Tac-Toe AI using Python, leveraging the Minimax algorithm with Alpha-Beta pruning for optimal decision-making. Features include parallelization for performance and heuristic evaluation. Play against the AI in a console-based game, exploring strategies and performance optimizations in game theory.
Project for playing checkers. App supports two game modes: Single Player (player vs bot) or two players (player vs player) and with or without fourcing jumps. This project was created as project for algorithms and data structures, subject in II semestar on Faculty of tehnical science in Novi Sad using minimax algorithm with alpha-beta pruning with
A comprehensive solutions and analyses for the Uninformed Search & Informed Search. It includes implementations of various AI search algorithms, route finding strategies between cities, social network graph analysis, and heuristic analysis in AI.