Labyrinth:how to find the path?

[terance]

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 ?

[dmitry_vk]

Do you want to find the exit or the path to the exit? I assume that you want the path.
You can use breadth-first search (http://en.wikipedia.org/wiki/Breadth-first_search) to find it (it will the shortest path).

[terance]

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?

[dmitry_vk]

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?

In this list you have all the edges of a graph. So this list one of the ways to represent the graph. When you do a breadth-first search, the only thing that needs to be known about the graph is the start vertex (IN), goal (OUT vertex), and the way to enumerate all vertices that are connected to the current one. So, you just need to implement a function that will search which vertices are connected to the given one and plug it into the search algorithm. This function can operate directly on this list or it can use the array/hashtable that contains the mapping from vertices to adjacent vertices.

[terance]

I've wote something .It's working, but I'd like to know how to re-write this code without using

Code: Select all

 setq

?

Code: Select all

(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 (labirint)                                                                                       
  (setq way (cons (search_room(first way) labirint) way))   ;(push (search_room(first  *way-out*) labirint)  *way-out*)                                                     
     (cons (eql (car way) 'out)                                                                                   
         (t (reverse way)))     ;переварачивает а потом разрушает список way                                                                                       
         (search_path labirint))


[qbg]

I've wote something .It's working, but I'd like to know how to re-write this code without using

Code: Select all

 setq

?

Code: Select all

(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 (labirint)                                                                                       
  (setq way (cons (search_room(first way) labirint) way))   ;(push (search_room(first  *way-out*) labirint)  *way-out*)                                                     
     (cons (eql (car way) 'out)                                                                                   
         (t (reverse way)))     ;переварачивает а потом разрушает список way                                                                                       
         (search_path labirint))


Very minimal: For your second function, you could transform:

Code: Select all

(setq way '(in))
(defun ...)


to

Code: Select all

(let ((way '(in)))
  (defun ...))


Then use setf instead of setq inside (really no difference; setf will expand to setq here).

[terance]

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!"