1 / 22

A.I. and Games

A.I. and Games. Lauren Argenio and Russell Braun. Turing Test. Can machines think? How can we tell? Do we even know what thinking is? Uh oh…. Turing Test. Solution: Humans are the best judges of intelligence so…

lucas-haynes
Download Presentation

A.I. and Games

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. A.I. and Games Lauren Argenio and Russell Braun

  2. Turing Test Can machines think? How can we tell? Do we even know what thinking is? Uh oh…

  3. Turing Test Solution: Humans are the best judges of intelligence so… If a computer can convince a human that it is intelligent, then it must be doing something close to “thinking.”

  4. Turing Test

  5. Algorithms An algorithm is a sequence of -Finite -Well-defined instructions for completing a task.

  6. Branch

  7. Loop

  8. Search trees

  9. Search trees

  10. Search trees

  11. Search trees Branch Node Leaf node

  12. Search trees

  13. Search tree used in games Branch Node Leaf node

  14. Search tree used in games

  15. MinMax -2 very good for the OTHER player +2 very good +1, pretty good, but risky

  16. MinMax

  17. MinMax

  18. Project progress • Learned how search trees are applied to games • Sorting algorithms • Search algorithms

  19. Program example Whose turn is it? Computer chooses random move out of the remaining ones available Player Computer Player makes a move Computer makes move Update board Has somebody won? No Yes Congratulate winner

  20. Program example Computer calculates all remaining possible moves Whose turn is it? Computer gives a value to each move Player Computer Computer chooses the set of moves that let it win with the biggest advantage (highest number) Player makes a move Computer makes move Update board Has somebody won? No Yes Congratulate winner

  21. Quiz slide 1. What is the purpose of the Turing test? 2. Describe a possible situation that could be represented by a search tree. 3. Explain how AIs compensate for lack of intuition with greater speed and processing power. 4. What does a leaf node represent in the search tree for a game.

  22. references • Wikipedia • Google Image Search • Shoman, Yoav. "Computer Science and Game Theory." www.acm.org. Association for Computing Machienery. 04 Feb. 2009 <http://www.acm.org/>. • http://www.ocf.berkeley.edu/~yosenl/extras/alphabeta/alphabeta.html • http://ai-depot.com/articles/minimax-explained/

More Related