Asst3 - CSE 305 Spring 2011 Assignment #3: Game Trees and...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE 305 Spring 2011 Assignment #3: Game Trees and Minimax Assigned: March 21 Due April 3 (11:59 pm) The context for this assignment is a two-player game, such as chess, where one of the two players is the computer and the other is the user. When it is the computer‟s turn to make a move, it would construct a data structure known as a gametree in order to decide the best move to make. Each node of a gametree records some state of the game. The levels of a gametree alternate between states in which it is the computer‟s turn to make a move and those in which it is the user‟s turn. Each leaf node records the state of the game after a finite sequence of moves have been made. The branching factor of a gametree is not fixed, and could vary from one node to another – because the number of moves that one could make could vary from one state to another. Assume that each leaf node can be mapped to a number indicating how “strong” the computer would be in that state. Then, the gametree is analyzed recursively as follows: At the root node, the computer chooses the next state (child node) that maximizes its strength; and, for each such next state, it assumes that the user would choose the next state that
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/23/2011 for the course ENCS ENCS5 taught by Professor Abdelsalam during the Spring '10 term at Birzeit University.

Page1 / 2

Asst3 - CSE 305 Spring 2011 Assignment #3: Game Trees and...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online