Alpha-beta pruning example: Step 1 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

2/15/2001


Click here to start


Table of Contents

Alpha-beta pruning example: Step 1 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 2 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 3 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 4 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 5 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 6 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 7 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 8 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 9 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 10 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 11 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 12 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 13 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 14 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 15 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 16 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 17 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Alpha-beta pruning example: Step 18 a is the maximum lower bound of possible solutions (MAX plays) b is the minimum upper bound of possible solutions (MIN plays)

Author: Mikael Bodén

Email: mikael.boden@ide.his.se

Home Page: http://www.hh.se/staff/mibo