CSCE 315 Lecture 15
Jump to navigation
Jump to search
« previous | Friday, February 24, 2012 | next »
Artificial Intelligence
Very diverse field:
- strong AI
- Get a computer to think on its own
- weak AI
- Having a computer behave intelligently
Often mixed with other fields
Game Playing and Search
Theorem proving by modifying internal state of what we know
State Graph
- Number and destination of edges limited by rules
- Examine possible states and transition to find the goal state
- In games, states and moves can be ranked (more kings in checkers is better)
- Traversing edges applies an operation (applying a theorem, moving a game piece)
- Arriving at a new state implies we have more information
Types of Games
- Deterministic vs. Random factor
- Known state vs. hidden information
| Deterministic | Chance | |
|---|---|---|
| Perfect Info | Chess, Checkers, Othello, Go | Monopoly, Backgammon |
| Imperfect Info | Stratego, Bridge? | Poker, Scrabble, Bridge? |