Advertisement
Latkoski

Пребарување BFS - принц принцеза

Jan 7th, 2017
100
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Lisp 4.30 KB | None | 0 0
  1. (defun run-breadth (start goal moves)
  2.   (declare (special *open*))
  3.   (declare (special *closed*))
  4.   (declare (special *goal*))
  5.   (setq *open* (list (build-record start nil)))
  6.   (setq *closed* nil)
  7.   (setq *goal* goal)
  8.   (breadth-first moves))
  9.  
  10. ;;; These functions handle the creation and access of (state parent)
  11. ;;; pairs.
  12.  
  13. (defun build-record (state parent) (list state parent))
  14.  
  15. (defun get-state (state-tuple) (nth 0 state-tuple))
  16.  
  17. (defun get-parent (state-tuple) (nth 1 state-tuple))
  18.  
  19. (defun retrieve-by-state (state list)
  20.   (cond ((null list) nil)
  21.         ((equal state (get-state (car list))) (car list))
  22.         (t (retrieve-by-state state (cdr list)))))
  23.  
  24.  
  25.  
  26. (defun breadth-first (moves)
  27.   (declare (special *open*))
  28.   (declare (special *closed*))
  29.   (declare (special *goal*))
  30.   (cond ((null *open*) nil)
  31.         (t (let ((state (car *open*)))
  32.              (setq *closed* (cons state *closed*))
  33.  
  34.              (cond
  35.     ;;; found solution: print path to it
  36.         ((equal (get-state state) *goal*) (reverse (build-solution *goal*)))
  37.              
  38.             ;;; try next child state
  39.                 (t (setq *open*
  40.                             (append (cdr *open*)
  41.                                     (generate-descendants (get-state state)
  42.                                                           moves)))
  43.                       (breadth-first moves)))))))
  44.  
  45. (defun generate-descendants (state moves)
  46.   (declare (special *open*))
  47.   (declare (special *closed*))
  48.   (cond ((null moves) nil)
  49.         (t (let ((child (funcall (car moves) state))
  50.                  (rest (generate-descendants state (cdr moves))))
  51.              (cond ((null child) rest)
  52.                    ((retrieve-by-state child rest) rest)
  53.                    ((retrieve-by-state child *open*) rest)
  54.                    ((retrieve-by-state child *closed*) rest)
  55.                    (t (cons (build-record child state) rest)))))))
  56.  
  57.  
  58. (defun build-solution (state)
  59.   (declare (special *closed*))
  60.   (cond ((null state) nil)
  61.         (t (cons state (build-solution
  62.                         (get-parent
  63.                          (retrieve-by-state state *closed*)))))))
  64.  
  65. (defvar *initial* '((0 2) (4 0) ((0 0) (3 3)) ((2 2) (2 3 (3 2)))))
  66.  
  67.  
  68. (setq *prince* (car *initial*))
  69. (setq *queen* (cadr *initial*))
  70. (setq *ghostlist* (caddr *initial*))
  71. (setq *dragonlist* (cadddr *initial*))
  72.  
  73.  
  74. (defun make-state (x y)
  75.     (list x y)
  76.     )
  77.  
  78.  
  79. (defun safeFromDragons (state *dragonlist*)
  80.     (cond
  81.         ((null *dragonlist*) t)
  82.         ((or(equal state (make-state (+ 1 (caar *dragonlist*))(cadar *dragonlist*)))
  83.            (equal state (make-state (- (caar *dragonlist*) 1)(cadar *dragonlist*)))
  84.            (equal state (make-state (caar *dragonlist*)(+ 1 (cadar *dragonlist*))))
  85.            (equal state (make-state (caar *dragonlist*)(- (cadar *dragonlist*) 1)))
  86.            (equal state (make-state (+ 1 (caar *dragonlist*))(+ 1 (cadar *dragonlist*))))
  87.            (equal state (make-state (+ 1 (caar *dragonlist*))(- (cadar *dragonlist*) 1)))
  88.            (equal state (make-state (- (caar *dragonlist*) 1)(+ 1 (cadar *dragonlist*))))
  89.            (equal state (make-state (- (caar *dragonlist*) 1)(- (cadar *dragonlist*) 1)))) nil)
  90.         (t (safeFromDragons state (cdr *dragonlist*)))
  91.         ))
  92.    
  93.  
  94. (defun safe (state)
  95.     (cond
  96.         ((equal (safeFromDragons state *dragonlist*) nil) nil)
  97.         ((or (> (car state) 4)(> (cadr state) 4)(< (car state) 0)(< (cadr state) 0)) nil)
  98.         (t state)
  99.         )
  100.     )
  101.  
  102. (defun gore (state)
  103.     (safe (make-state (+ (car state) 1)(cadr state)))
  104.     )
  105.  
  106. (defun dolu (state)
  107.     (safe (make-state (- (car state) 1)(cadr state)))
  108.     )
  109.  
  110. (defun levo (state)
  111.     (safe (make-state (car state)(- (cadr state) 1)))
  112.     )
  113.  
  114. (defun desno (state)
  115.     (safe (make-state (car state)(+ (cadr state) 1)))
  116.     )
  117.  
  118. (defun gorelevo (state)
  119.     (safe(make-state (+ 1 (car state))(- (cadr state) 1)))
  120.     )
  121. (defun goredesno (state)
  122.     (safe (make-state (+ 1 (car state))(+ 1 (cadr state))))
  123.     )
  124.  
  125. (defun dolulevo (state)
  126.     (safe (make-state (- (car state) 1)(- (cadr state) 1)))
  127.     )
  128. (defun doludesno (state)
  129.     (safe (make-state (- (car state) 1)(+ (cadr state) 1)))
  130.     )
  131.  
  132.  
  133. (print (run-breadth *prince* *queen* '(gore dolu levo desno gorelevo goredesno dolulevo doludesno)))
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement