ted.
           The search algorithm (see <A href="sf-search.html">SEARCH</A>) will use this space as a starting point.
        </P>
    </DD>

    <DT>
      <TT><A name="readSolution">readSolution</A> <I>space</I></TT>
    </DT>
    <DD><P>This function should extract a solution from a solved space (<TT>space</TT>).</P>
    </DD>

    <DT>
      <TT><A name="copyq">copyq</A> <I>depth</I></TT>
    </DT>
    <DD><P><I>Recomputation policy</I>: all the nodes of the search tree whose depth satisfies
        t