What does node extension mean?

Question

I am trying to understand the algorithm for Depth-Limited-Search on wikipedia, and I am trying to figure out what exactly the node extension means. I tried to find the answer, but all I had was more algorithms that indicate the nodes should be expanded.

In particular, what does the string stack := expand (node) mean in relation to the whole function?

  DLS(node, goal, depth) { if (node == goal) return node; push_stack(node); while (stack is not empty) { if (depth > 0) { stack := expand (node) node = stack.pop(); DLS(node, goal, depth-1); } else // no operation } } 

Answer 1

In this context, it returns all the children of the node as a new stack. This is a very poorly written sample code bit.

Answer 2

"expand a node" means finding nodes of children