This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (Game-theoretic disclaimer: To have “perfect information”, the number of stones in the pile is known . . .) 2. Pursuing the following three implementations is encouraged: a. Brute-force, top-down, recursive predicate that indicates whether there is a win in a particular state. b. Fast version of a. that caches (or “memoizes”) known results. c. After spending some time in this “exploratory programming” scenario, you realize that there is a trivial (but perfect) “evaluation function” for this game....
View Full Document
This note was uploaded on 03/25/2012 for the course CSE 2320 taught by Professor Bobweems during the Spring '12 term at UT Arlington.
- Spring '12