Computers Playing Games. Arif Zaman CS 101. Acknowledgements. Portions of this are taken from MIT’s open-courseware http://ocw.mit.edu/ Some items are adapted from Chapter 5 on Games by some professor who adapted it from notes by Charles R. Dyer, University of Wisconsin-Madison. Why Play?.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Russians believed that better would be an excellent but slow static evaluator with lower plies.
The extreme strategies are of course a perfect evaluator with 1-ply
Or the complete game-tree search with trivial evaluator.Crude Evaluator
Quiessence: Static evaluate at peaceful situations. Go deeper into fights.
Lookup Tables: for opening moves.
Special program: for endgames.Other Tricks
Created a strong player without any initial knowledge, by breeding a program!
Start with a “population” of 100 “random” programs.
Have a competition, and kill the 90 losers. Breed the 10 winners by “mixing” their “genes” with a bit of “mutation.”
Do the same for many generations (1000’s).Reversi (Othello)
Programs quickly learned the basic positional strategy:
Avoid neighbors of corners
Take neighbors of neighbors of corners.
Keep low piece count
Restrict opponents moves
Discovered only once in Japan, and then everyone learnt it from them.Positional Strategy