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…

If a computer can convince a human that it is intelligent, then it must be doing

something close to “thinking.”

Turing Test

Algorithms

An algorithm is a sequence of

-Finite

-Well-defined

instructions for completing a task.

Branch

Loop

Search trees

Search trees

Search trees

Search trees

Node

Branch

Leaf node

Search trees

Search tree used in games

Node

Branch

Leaf node

Search tree used in games

MinMax

-2 very good for the OTHER player

+1, pretty good, but risky

+2 very good

MinMax

MinMax

Project progress

• Learned how search trees are applied to games

• Sorting algorithms

• Search algorithms

Program example

Player makes a move

Computer chooses random move out of the remaining ones available

Computer makes move

Has somebody won?

Congratulate winner

Update board

Whose turn is it?

Yes

Player

No

Computer

Program example

Player makes a move

Computer calculates all remaining possible moves

Computer makes move

Has somebody won?

Update board

Whose turn is it?

Yes

PlayerComputer Computer gives a

value to each move

Computer chooses the set of moves that let it win with the biggest advantage (highest number)

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.

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/