-
Notifications
You must be signed in to change notification settings - Fork 0
LeoSSSSSheng/Adversarial-Search
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
AI GAME Design and Implementing Designed all data structure in game adversarial search, implementing mini-max algorithm and alpha-beta pruning optimization. Getting Started These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system. Prerequisites Familiar with Java Installing Downloading input file and .java file javac *.java java * (* is the name of the main program) End with an example of getting some data out of the system or using it for a little demo Running the tests For automation test, uncomment all System.out* lines game will be printed for step by step test. Explain what these tests test and why These tests are used for breaking tie for specific coding requirement in competing mode. Deployment Add additional notes about how to deploy this on a live system Built With java Contributing Chunyang Sheng
About
No description or website provided.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published