![]()
Visiting guest. Why not sign in?
|
|
Reply to Message
Not registered yet?
The AI Depot has a focused community of friendly users. Rather than let anyone abuse the site at the brink of promiscuity, we prefer to let only those with an active interest participate... this simply requires registering.
Why not sign up!
Joining the site's community is completely free. You can then post messages freely, and customise your personal profile at will. Specific privileges will also be granted to you, like being able to access printer-friendly articles without restrictions. So, why not register?
Parent Message
Minimax Explained
Tutorial - Minimax Explained
Paulo Pinto's contest entry has just been posted. Discusses how search can be applied to logic games with full information. Game trees are described, as well as an algorithm that can search them. Pseudo code is given and optimisations like alpha-beta are explained. http://ai-depot.com/LogicGames/MiniMax.html Be sure to check out the current contest for a bit of action! |
|
Broken links in last page of tutorial
Very good article. I like it a lot. Would be nice if you give more samples like Connect 4, Othello, Gomoku, etc to learn from. Anyway, hope you can fix the link on the last page of your tutorial. Thanks. |
|
Broken Links
I've updated my site and that update broke the links. http://www.progtools.org/games/projects/checkers/checkers.html |
|
Typo in function MinValue?
Hi, I wonder if the function MinValue in the pseudo code contains a slight error. Because you want the lowest value, shouldn't best_move be initialized as "maximum", so that all evaluations result in lower values. And, shouldn't the 'if Value > best_move' be 'if Value < best_move' (less than)? Thanks for writing it anyway! Patrick. |
|
Taking a closer look
I will take a closer look to the code. |
|
Back to the Artificial Intelligence Depot.