1 / 10

King Fish

Clover Bobker Nikita Kiriy Juan Pablo Sarmiento. King Fish. Fishy fishy. Problem Statement and Motivation. Make an adaptive AI player that can win a game against another “smart” AI. Project Scope: Stage one: pre-programmed AI player. Can beat random player with heuristic move choices.

collin
Download Presentation

King Fish

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Clover Bobker Nikita Kiriy Juan Pablo Sarmiento King Fish Fishy fishy

  2. Problem Statement and Motivation • Make an adaptive AI player that can win a game against another “smart” AI. • Project Scope: • Stage one: pre-programmed AI player. Can beat random player with heuristic move choices. • Stage two: analyzes opponent's strategy real time and adapts to it.

  3. I/O Specification • Inputs: • At the start of game: board layout and obstacles. • Each turn: position of players and any gray markers. • Outputs: • Next move to perform.

  4. Background Reading • Class textbook for high level techniques and design. • Online resources on automated chinese checker players (if available).

  5. Generic Approach • Stage 1: • Rules and heuristic search. • Make AI learn from a dataset of recorded games. • Stage 2: • Create a model of the opponent during the game. Predict opponents moves.

  6. System Architecture and work plan • Independent parts to our system: • Time distribution decision system (limit of 10 minutes) • Learning system that trains off of previous games (Stage 1 AI) • System of rules of the game • Shortest-path finder system to take obstacles into account

  7. Data Sources • Learn from recorded games • Our bots playing themselves • From people (friends) playing with our bot • We would have to design an interface for this

  8. Evaluation Plans • Metrics: • Estimate average time needed per mood and overhead planning time • Make sure memory doesn't crash computer • Improve victory margin (in case of ties) • Test problems: • Give AI prearranged board with a winning strategy composed of several moves. • Simple case: one move. Hard case: increase number of moves. • Make sure AI performs winning sequence of moves each time.

  9. Schedule

  10. Schedule

More Related