COMP 102 Lecture Notes - Lecture 17: Marion Tinsley, Garry Kasparov, Lee Sedol
17 Mar 2016
School
Department
Course
Professor
Document Summary
Suppose the evaluation f(x) would result in the below values if we searched that tree. Dam control - least of the worst - the left case. Order matters - if the worse comes out first, we skip other nodes. It does not change the result, but saves time. If the 3 node in the middle branch were moved one step left. We do not need to check the remaining 2 nodes in branch. Likewise for the 2 node in the right branch. Checkers: 1994: chinook (u. of a. ) beat world champion marion tinsley, ending 40-yr reign. Othello: 1997: logistello (nec research) beat the human world champion: today: world champions refuse to play ai computer program (because it"s too good). 1997: deep blue (ibm) beat world champion gary. : td-gammon (ibm) is world champion amongst humans and computers. Bridge : still out of reach for ai players because of coordination issue. Computer learning the evaluation function - make system determine this e. g. )
