Timeline for Minimax Algorithm Scoring Mechanism
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 3, 2020 at 13:44 | comment | added | DMGregory♦ | Your score function evaluation becomes the single number you report as the score for this leaf of the search tree. Once you've scored all the children of a particular parent node (by hitting an end state, using your heuristic, or recursing), then the parent node's score becomes either the min or the max of all its children's scores (depending on whether that parent node represents the minimizing or maximizing player's turn). Now this parent node has a score, that can bubble up to its parent node to choose the max or min of its children, etc. | |
| Oct 3, 2020 at 13:12 | comment | added | omer simchoni | Thank you so much! So, I am starting to connect the dots.. When I'm reaching my maximum depth and I'm not recursing further in, I am basically looping to go through all spots (to evaluate the board) and, if I understand how this algorithm works, the minimizing player will end up taking the lowest score possible from this evaluation, and the maximizing player will end up taking the highest score possible? Should I add an if statement saying if maximizing / if minimizing and consistently check for the lowest/highest score like in the minimax itself, where we have the isMaximizing == true/false? | |
| Oct 2, 2020 at 15:40 | history | edited | DMGregory♦ | CC BY-SA 4.0 |
Typo
|
| Oct 2, 2020 at 14:47 | history | answered | DMGregory♦ | CC BY-SA 4.0 |