CSC 140 Lecture Notes - Lecture 10: Randomness, Decision-Making, Spinster

9 views7 pages

Document Summary

Delaying or preventing solvability: a game is solvable if the entire possibility space is known ahead of time and can be exploited such that a specific player, playing correctly, can always win (or draw). For games with small enough possibility spaces to be solvable by a computer (and especially a human), however, something must be done to keep the game fresh: adding a random element is one way to accomplish this. It prevents us from mastering the game, because making the same exact decisions may lead to different outcomes. In a pure strategy/skill game like chess, a sufficiently strong player will always beat a weaker player: some people enjoy this aspect of games. If they beat another player that they wholly earned that victory. Enhancing decision making: the essence of most games is the decisions that the players make. In a pure strategy game, players have complete information and know the exact outcome of every move that they make.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions