minimax depth first search game tree
Posted
by Arvind
on Stack Overflow
See other posts from Stack Overflow
or by Arvind
Published on 2010-02-27T17:29:24Z
Indexed on
2010/03/17
7:31 UTC
Read the original article
Hit count: 592
Hi
I want to build a game tree for nine men's morris game. I want to apply minimax algorithm on the tree for doing node evaluations. Minimax uses DFS to evaluate nodes. So should I build the tree first upto a given depth and then apply minimax or can the process of building the tree and evaluation occur together in recursive minimax DFS?
Thank you Arvind
© Stack Overflow or respective owner