Skip to content
#

alpha-beta-pruning

Here are 88 public repositories matching this topic...

Project Showcase: Unbeatable Tic-Tac-Toe AI Game I utilized the Minimax algorithm with Alpha-Beta Pruning to create an unbeatable AI opponent. This ensures that the AI always makes the optimal move, providing a challenging and fair game for human players. The project helped me deepen my understanding of game theory and basic search algorithms.

  • Updated Jun 6, 2024
  • JavaScript

Improve this page

Add a description, image, and links to the alpha-beta-pruning topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the alpha-beta-pruning topic, visit your repo's landing page and select "manage topics."

Learn more