1. Lauren Argenio and Russell Braun
A.I. and Games
Lauren Argenio and Russell Braun

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

3. Humans are the best judges of intelligence so…
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?
Player
Computer gives a value to each move
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." Association for Computing Machienery. 04 Feb <