The below is from an article titled:
Minimax: Recursive Implementation
To be a recursive function, you need to call yourself.
- What part of this pseudo code is calling itself?
- How does depth-first effect the recursion process?
- There seems to be a return in every line of
minimax-value, shouldn't the return be only on a terminal case?
value[op]contain the moves in order from the root node?
- What does
Apply(op,game)do the very first time through?
Any pointers are greatly appreciated.