From: linus sellberg <sellberg@...>
Date: 2005-04-11T14:54:44+09:00
Subject: Re: [QUIZ] Knight's Travails (#27)

Kero wrote:

> # - breadth first search like this (dynamic programming style, too) keeps
> #   pointers (steps) towards the point where you start the algorithm, so we
> #   have to start at the finish. Quite normal for Dijkstra, now that I think of

Oh, I wish I thought of that, my solution has to reverse the path 
afterwards :(