1 / 8

CS 4701 – Project Proposal

CS 4701 – Project Proposal. Jane Park (jp624) Ran Zhao (rz54). Problem Statement and Motivation Create an efficient and powerful Chinese Checkers AI Challenges: Irregular hexagonal board High branching factor Greedy solutions are suboptimal

harry
Download Presentation

CS 4701 – Project Proposal

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. CS 4701 – Project Proposal Jane Park (jp624) Ran Zhao (rz54)

  2. Problem Statement and Motivation • Create an efficient and powerful Chinese Checkers AI • Challenges: • Irregular hexagonal board • High branching factor • Greedy solutions are suboptimal • Opponent plays an important role (can be leveraged) • Motivation: • TD Gammon – teaching itself by playing against itself • A heart-felt desire for academic enlightenment in the area of artificial intelligence

  3. I/O Specification • Input: • Board configuration • Training data • Output: • Optimal move as determined by the AI System.

  4. Background Reading • “Temporal Difference Learning and TD-Gammon” by Gerald Tesauro • “Algorithm Design” by Jon Kleinberg • “Machine Learning” by Tom Mitchell • “Effective Java” by Joshua Bloch • “Art of War” by Sun Tzu

  5. General Approaches • Uncle Scrooge • Green Mushroom • Lime Soda • ThorstenJoachims • 中华人民共和国 • Hard Code

  6. System Architecture and Work Plan • Components • Data collection and aggregation • Machine Learning system • Strategic Game Play system • Tasks • Basic AIs • Data Collection • Machine Learning • Parallel Computing • Distributed Caching • Marketing

  7. Data sources • Non-deterministic AI Players • Human players • Hand generated

  8. Evaluation Plans • Number of turns to win against the following opponents and the margin of victory: • No opponent • JP624 • Greedy AI • RZ54 • Self • Win/loss ratio against random human players

More Related