LispForum

Hi to everyone!I have problems with my code:it doesn't detect cycles in the labyrinth...Any ideas about how to detect cycles?
My idea is that when romm meets 2 times in the variable PATH program should write:"Cycle exists!"

I've wote something .It's working, but I'd like to know how to re-write this code without using setq ? (defun search_room (point labirint) (cond ((null labirint) nil) ((eql (caar labirint) point) (second (car labirint))) (t (search_room point (cdr labirint))))) (setq way '(in)) (defun search_path (l...

yep you are right ....I need a path ...
Could you explaine how to build from this list:((1 2) (2 4) (IN 1) (IN 3) (1 3) (4 5) (5 OUT)) correct graph?

I have a list of the rooms(e.x. ((1 2) (2 4) (IN 1) (IN 3) (1 3) (4 5) (5 OUT)),where () means that rooms are connected with each other "IN"-entrance,"OUT"-exit).Would you be so kind to explaine the algorithm ,which can find the exit ?