chess:programming:search:negamax
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revision | |||
chess:programming:search:negamax [2021/10/11 23:40] – peter | chess:programming:search:negamax [2021/10/11 23:50] (current) – peter | ||
---|---|---|---|
Line 9: | Line 9: | ||
===== How to Use NegaMax ===== | ===== How to Use NegaMax ===== | ||
- | NegaMax is called | + | NegaMax is called |
+ | |||
+ | In the loop which generates all the root moves: | ||
+ | |||
+ | * Generate a **Score** relative | ||
+ | * In the Root retain the returned score for each potential move. | ||
+ | * Pick the move with the lowest score. | ||
---- | ---- |
chess/programming/search/negamax.1633995608.txt.gz · Last modified: 2021/10/11 23:40 by peter