Логическая игра

(defun finish(K)
  (and
    (eq (caddar K) 'molochnik)
    (eq (car (cddadr K)) 'chainik)
  )
)
 
(defun moves(K)
  (let ( (A11 (caar K)) (A12 (cadar K)) (A13 (caddar K)) 
         (A21 (caar (cdr K))) (A22 (cadar (cdr K))) (A23 (caddar (cdr K))) 
       )
    (append
      (if (or (eq A11 'pusto) (eq A21 'pusto))
            (list (list (list A21 A12 A13) (list A11 A22 A23))))  ;replace 1.1 <-> 2.1
      (if (or (eq A12 'pusto) (eq A22 'pusto))
            (list (list (list A11 A22 A13) (list A21 A12 A23))))  ;replace 1.2 <-> 2.2
      (if (or (eq A13 'pusto) (eq A23 'pusto))
            (list (list (list A11 A12 A23) (list  A21 A22 A13))))  ;replace 1.3 <-> 2.3
      (if (or (eq A11 'pusto) (eq A12 'pusto))
            (list (list (list A12 A11 A13) (list  A21 A22 A23))))  ;replace 1.1 <-> 1.2
      (if (or (eq A12 'pusto) (eq A13 'pusto))
            (list (list (list A11 A13 A12) (list  A21 A22 A23))))  ;replace 1.2 <-> 1.3
      (if (or (eq A21 'pusto) (eq A22 'pusto))
            (list (list (list A11 A12 A13) (list  A22 A21 A23))))  ;replace 2.1 <-> 2.2
      (if (or (eq A22 'pusto) (eq A23 'pusto))
            (list (list (list A11 A12 A13) (list  A21 A23 A22))))  ;replace 2.2 <-> 2.3
    )  
  )
)
 
(defun start-list()
  '((chashka pusto chainik) (chashka chashka molochnik))
)
 
 
(defun pomen(K M S)
  (cond
    ((finish K) (reverse (cons K S)))
    ((null M) nil)
    ((member (car M) S :test #'equal) (pomen K (cdr M) S))
    (t
       (or 
          (pomen (car M) (moves (car M)) (cons K S))
          (pomen K (cdr M) S)
       )
    )
  )
)
 
 
(defun main()
  (pomen (start-list) (moves (start-list)) '())
)
 
(main)