On Thu, 15 Feb 2001, Chen Shapira wrote:
> >
> > Actually, when using BFS it can be proved that such thing is
> > not possible.
> > Since BFS by definition finds the shortest path between the
> > source and the
> > destination than if a BFS on node A suggested a movement to
> > node B and if
> > the BFS on node B suggested a move to node A, then we could
> > have saved two
> > moves by staying at B, which contradicts the definition of BFS.
>
> But he talked about a case when a user moves NOT according to the hint.
>
Then, in that case the solver will give a completely different solution.
If you follow the hints all along you will eventually get to a
complete solution.
Besides, that paragraph is about Graph Theory, not really about practice.
Regards,
Shlomi Fish
>
> To unsubscribe from this group, send an email to:
> fc-solve-discuss-unsubscribe_at_yahoogroups.com
>
>
>
----------------------------------------------------------------------
Shlomi Fish shlomif_at_vipe.technion.ac.il
Home Page:
http://t2.technion.ac.il/~shlomif/
Home E-mail: shlomif_at_techie.com
The prefix "God Said" has the extraordinary logical property of
converting any statement that follows it into a true one.
Received on Thu Feb 15 2001 - 07:59:10 IST