# Where is the recursion, in the minimax-decision algorithm?

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?
• Will 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.

• Don't use images as main content of your post. Not only is it lazy, it also makes your question impossible to search and inaccessible to the visually impaired; we don't like that. Please transcribe text and maths (note that you can use LaTeX) and don't forget to give proper attribution to your sources! – D.W. Feb 17 '14 at 5:00
• You sure have an awful lot of questions in this post. We ask people to stick to one question per question. Also, we expect you to make a serious effort before asking here. What have you tried? Have you tried working through a small example by hand, manually simulating the algorithm? You would probably find that very helpful in enabling you to answer many of your own questions. – D.W. Feb 17 '14 at 5:02