Re: Labirint in LISP please help me



On 13 avr, 09:59, Jason <jeme...@xxxxxxxxx> wrote:
On Apr 12, 11:53 pm, Aliska <alisa.sincovs...@xxxxxxxxx> wrote:

Labyrinth can be represented in the list: L = ((i1, J1) (i2, J2), ...,
(In, JN)), where (ik, jk) is the existence a way  from ik room in
jk.
Write function that checks if it can pass from ie room in  jm. Show
that path if it exists.
(LABIRINT L ie im)

Hold your left hand against the "wall". Walk forward, never removing
your hand. If you reach the destination, then print the path. If you
end up back where you started, then no path. Simple enough.

-Jason

Can I write in one function?
.