五子棋游^戏编程.pptVIP

Computer Go: An AI oriented survey Artificial Intelligence, Volume 132, Issue 1, October 2001, Pages 39-103 Bruno Bouzy , Tristan Cazenave 2004.10.14 劉思源 Outline Introduction (Go) Other games Results Evaluation Move generation Tree search Optimization Combinatorial game theory Automatic generation of knowledge Monte Carlo Go Mathematical morphology Cognitive science Conclusion Introduction mind games have been studied as application fields for AI  they do not enable the AI community to build a strong Go program  the current cornerstone in game programming is the Alpha-Beta algorithm Introduction Go programs have poor rankings in the human ranking system  Go programs exhibit structure at different levels In order to be competitive, every level of a Go program has to be optimized  Therefore Go programmers spend much of their time on optimizations Introduction The game of Go is a global game that can be broken down into many local sub-games  Although local sub-games are generally dependent, the combinatorial game theory offers an appropriate model for the game of Go A problem inherent in Computer Go is that the models with the best results use a lot of knowledge Introduction The game of Go is a very visual game  Go is so complex that it can be used to perform interesting cognitive experiments  We think that Computer Go remains a new domain for computer science, and so far, no clear theoretical model has emerged  Other games Go-moku 變形五子棋 Backgammon 西洋雙陸棋 Othello 黑白棋 Checkers 西洋跳棋 Draughts 英式象棋 Chess 西洋棋 Shogi 將棋 Other games Theoretical complexity Space states and game tree complexity of other games the space states complexity (E) as the number of positions you can reach from the starting position game tree complexity (A) as the number of nodes in the smallest tree necessary to solve the game  Complexity of Go Other games Other games Results History of Computer Go (Since 1963) Computer Go competitions (the ING cup, FOST cup, ladder