chess:programming:alpha-beta_pruning:example
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| chess:programming:alpha-beta_pruning:example [2021/10/30 23:31] – peter | chess:programming:alpha-beta_pruning:example [2021/10/30 23:35] (current) – peter | ||
|---|---|---|---|
| Line 36: | Line 36: | ||
| * At B, beta = min(5, 6) which is 5. | * At B, beta = min(5, 6) which is 5. | ||
| * The value of node B is also 5. | * The value of node B is also 5. | ||
| + | |||
| + | ---- | ||
| So far this is how our game tree looks. | So far this is how our game tree looks. | ||
| Line 43: | Line 45: | ||
| {{: | {{: | ||
| - | ---- | ||
| * B returns 5 to A. | * B returns 5 to A. | ||
| Line 69: | Line 70: | ||
| * Therefore the best value at A is max(5, 2) which is a 5. | * Therefore the best value at A is max(5, 2) which is a 5. | ||
| * Hence the optimal value that the maximizer can get is 5. | * Hence the optimal value that the maximizer can get is 5. | ||
| + | |||
| + | ---- | ||
| This is how our final game tree looks like. | This is how our final game tree looks like. | ||
chess/programming/alpha-beta_pruning/example.1635636691.txt.gz · Last modified: 2021/10/30 23:31 by peter