Author |
Topic: ai question about alpha-beta algorithm (Read 796 times) |
|
puzzlecracker
Senior Riddler
Men have become the tools of their tools
Gender:
Posts: 319
|
|
ai question about alpha-beta algorithm
« on: Jun 12th, 2006, 8:16pm » |
Quote Modify
|
If there are no constraints on the two terminal utilities, is it possible for any node to be pruned by alpha-beta?
|
|
IP Logged |
While we are postponing, life speeds by
|
|
|
Grimbal
wu::riddles Moderator Uberpuzzler
Gender:
Posts: 7527
|
|
Re: ai question about alpha-beta algorithm
« Reply #2 on: Jun 14th, 2006, 6:11am » |
Quote Modify
|
I also don't see why not. Mainly because I have no clue what "terminal utilities" and "alpha-beta" are.
|
|
IP Logged |
|
|
|
towr
wu::riddles Moderator Uberpuzzler
Some people are average, some are just mean.
Gender:
Posts: 13730
|
|
Re: ai question about alpha-beta algorithm
« Reply #3 on: Jun 14th, 2006, 7:59am » |
Quote Modify
|
on Jun 14th, 2006, 6:11am, Grimbal wrote:Mainly because I have no clue what "terminal utilities" and "alpha-beta" are. |
| I'm assuming the terminal utilities are the worths player 1 or 2 respectively gives to a possible end state of the 'game' (For chess it'd probably be 0, 1/2 or 1. Loss, draw or win. Although if there's prize money you can factor that in.) Alpha-beta is a method to help searching the total gamespace, similar to min-max. By keeping record of what you know you can achieve in the best and worst case, you can prune subtrees that don't maximize your utility.
|
|
IP Logged |
Wikipedia, Google, Mathworld, Integer sequence DB
|
|
|
|