Skip to content

Latest commit

 

History

History
18 lines (12 loc) · 783 Bytes

README.md

File metadata and controls

18 lines (12 loc) · 783 Bytes

3rd project from CS 4253-01

Introduction to Artificial Intelligence.

Taught by Dr. Sandip Sen at the University of Tulsa in SP 23.

This repository implements the following decision techniques to play a discretized soccer game:

  • Minimax game tree search.
  • Minimax game tree search with $\alpha$ - $\beta$ pruning.
  • Monte Carlo game tree search.

The goal of this project was to compare the advantages and disadvantages of these algorithms with the soccer game domain.

This repository is a fork of a discretized soccer game written by the TU MASTERS group. [1].

For more information, please see info

Demo: https://www.youtube.com/watch?v=DaO29T6z8AA