人工智能游戏开.pptVIP

Connect Four using Alpha-Beta Pruning Billy Landowski CptS 540 7 December 2010 Overview Background Connect Four as a search problem Alpha-beta pruning Details about winning Heuristics Implementation / Demo Conclusion Background Sold by Milton Bradley in February 1974 2 players Alternate turns Goal: Connect four tiles in a row horizontally, vertically, or diagonally Connect Four as a Search Problem ≤7 possible moves per turn Enumerate each move Continue for each board configuration Connect Four as a Search Problem States: Any board configuration with at most one player’s tile in each location I