e even if the searched graph itself is finite. <b>Note:</b> This seems odd, because the finiteness depends on how we conduct the search (parent discarding on or off).</td>
		<td>Can the solution property be checked <emph>only</emph> considering the last node (instead of considering the entire path)? Intuitively, does the way <emph>how</emph> one reaches a node in the original graph affect the question whether the path is a solution? If not, then any path to such a node is a solution, and then the solution p