chess:programming:late_move_reduction
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| chess:programming:late_move_reduction [2022/01/06 20:35] – peter | chess:programming:late_move_reduction [2022/01/06 20:56] (current) – peter | ||
|---|---|---|---|
| Line 86: | Line 86: | ||
| * These techniques are however a bit more tricky to implement. | * These techniques are however a bit more tricky to implement. | ||
| - | There are endless possibilities how to handle the reductions. | + | There are endless possibilities how to handle the reductions: |
| - | + | ||
| * You could for example try to reduce more than one ply or skip the research when a move comes back above alpha. | * You could for example try to reduce more than one ply or skip the research when a move comes back above alpha. | ||
| - | | + | |
| + | ---- | ||
| + | |||
| + | Simple late move reduction. | ||
| + | |||
| + | * Every move after the first four are reduced with one ply if they were not a capture or a check | ||
| ---- | ---- | ||
| [[Chess: | [[Chess: | ||
chess/programming/late_move_reduction.1641501306.txt.gz · Last modified: 2022/01/06 20:35 by peter