1 (define (ambeval exp env succeed fail)
2 ((analyze exp) env succeed fail))
4 (cond ((self-evaluating? exp)
5 (analyze-self-evaluating exp))
6 ((quoted? exp) (analyze-quoted exp))
7 ((variable? exp) (analyze-variable exp))
8 ((assignment? exp) (analyze-assignment exp))
9 ((definition? exp) (analyze-definition exp))
10 ((if? exp) (analyze-if exp))
11 ((and? exp) (analyze (and->if exp)))
12 ((or? exp) (analyze (or->if exp)))
13 ((not? exp) (analyze (not->if exp)))
14 ((xor? exp) (analyze (xor->or-and-not exp)))
15 ((lambda? exp) (analyze-lambda exp))
16 ((let? exp) (analyze (let->combination exp)))
17 ((let*? exp) (analyze (let*->nested-lets exp)))
18 ((named-let? exp) (analyze (named-let->combination exp)))
19 ((letrec? exp) (analyze (letrec->let exp)))
20 ((do? exp) (analyze (do->combination exp)))
21 ((begin? exp) (analyze-sequence (begin-actions exp)))
22 ((cond? exp) (analyze (cond->if exp)))
23 ((amb? exp) (analyze-amb exp))
24 ((application? exp) (analyze-application exp))
26 (error "Unknown expression type -- ANALYZE" exp))))
29 ;; analyzing procedures
30 (define (analyze-self-evaluating exp)
31 (lambda (env succeed fail)
33 (define (analyze-quoted exp)
34 (let ((qval (text-of-quotation exp)))
35 (lambda (env succeed fail)
36 (succeed qval fail))))
37 (define (analyze-variable exp)
38 (lambda (env succeed fail)
39 (succeed (lookup-variable-value exp env)
41 (define (analyze-lambda exp)
42 (let ((vars (lambda-parameters exp))
43 (bproc (analyze-sequence (scan-out-defines (lambda-body exp)))))
44 ;; (bproc (analyze-sequence (lambda-body exp))))
45 (lambda (env succeed fail)
46 (succeed (make-procedure vars bproc env)
48 (define (analyze-if exp)
49 (let ((pproc (analyze (if-predicate exp)))
50 (cproc (analyze (if-consequent exp)))
51 (aproc (analyze (if-alternative exp))))
52 (lambda (env succeed fail)
54 ;; success continuation for evaluating the predicate
55 ;; to obtain pred-value
56 (lambda (pred-value fail2)
57 (if (true? pred-value)
58 (cproc env succeed fail2)
59 (aproc env succeed fail2)))
60 ;; failure continuation for evaluating the predicate
62 (define (analyze-sequence exps)
63 (define (sequentially a b)
64 (lambda (env succeed fail)
66 ;; success continuation for calling a
67 (lambda (a-value fail2)
68 (b env succeed fail2))
69 ;; failure continuation for calling a
71 (define (loop first-proc rest-procs)
72 (if (null? rest-procs)
74 (loop (sequentially first-proc (car rest-procs))
76 (let ((procs (map analyze exps)))
78 (error "Empty sequence -- ANALYZE"))
79 (loop (car procs) (cdr procs))))
80 (define (analyze-definition exp)
81 (let ((var (definition-variable exp))
82 (vproc (analyze (definition-value exp))))
83 (lambda (env succeed fail)
86 (define-variable! var val env)
89 (define (analyze-assignment exp)
90 (let ((var (assignment-variable exp))
91 (vproc (analyze (assignment-value exp))))
92 (lambda (env succeed fail)
94 (lambda (val fail2) ; *1*
96 (lookup-variable-value var env)))
97 (set-variable-value! var val env)
100 (set-variable-value! var
106 (define (analyze-application exp)
107 (let ((fproc (analyze (operator exp)))
108 (aprocs (map analyze (operands exp))))
109 (lambda (env succeed fail)
116 proc args succeed fail3))
119 (define (get-args aprocs env succeed fail)
123 ;; success continuation for this aproc
125 (get-args (cdr aprocs)
127 ;; success continuation for recursive
130 (succeed (cons arg args)
135 (define (analyze-amb exp)
136 (let ((cprocs (map analyze (amb-choices exp))))
137 (lambda (env succeed fail)
138 (define (try-next choices)
144 (try-next (cdr choices))))))
152 (define (tagged-list? exp tag)
158 (define (amb? exp) (tagged-list? exp 'amb))
159 (define (amb-choices exp) (cdr exp))
161 ;; self-evaluating/variable/quoted
162 (define (self-evaluating? exp)
163 (cond ((number? exp) true)
166 (define (variable? exp) (symbol? exp))
167 (define (quoted? exp)
168 (tagged-list? exp 'quote))
169 (define (text-of-quotation exp) (cadr exp))
171 ;; assignment/definition
172 (define (assignment? exp)
173 (tagged-list? exp 'set!))
174 (define (assignment-variable exp) (cadr exp))
175 (define (assignment-value exp) (caddr exp))
176 (define (make-assignment var val)
177 (list 'set! var val))
178 (define (definition? exp)
179 (tagged-list? exp 'define))
180 (define (definition-variable exp)
181 (if (symbol? (cadr exp))
184 (define (definition-value exp)
185 (if (symbol? (cadr exp))
187 (make-lambda (cdadr exp) ; formal parameters
189 (define (make-definition var val)
193 (define (if? exp) (tagged-list? exp 'if))
194 (define (if-predicate exp) (cadr exp))
195 (define (if-consequent exp) (caddr exp))
196 (define (if-alternative exp)
197 (if (not (null? (cdddr exp)))
200 (define (make-if predicate consequent alternative)
201 (list 'if predicate consequent alternative))
204 (tagged-list? exp 'and))
205 (define (and-clauses exp)
208 (tagged-list? exp 'or))
209 (define (or-clauses exp)
211 (define (and->if exp)
212 (define (expand-clauses clauses)
213 (cond ((null? clauses) 'true)
214 ((null? (cdr clauses)) (car clauses))
215 (else (make-if (car clauses)
216 (expand-clauses (cdr clauses))
218 (expand-clauses (and-clauses exp)))
220 (define (expand-clauses clauses)
223 (make-if (car clauses)
225 (expand-clauses (cdr clauses)))))
226 (expand-clauses (or-clauses exp)))
228 (tagged-list? exp 'not))
229 (define (not->if exp)
230 `(if ,(cadr exp) false true))
232 (tagged-list? exp 'xor))
233 (define (xor->or-and-not exp)
234 (let ((pred-1 (cadr exp))
235 (pred-2 (caddr exp)))
236 `(or (and ,pred-1 (not ,pred-2))
237 (and (not ,pred-1) ,pred-2))))
239 ;; lambda/let/let*/letrec
240 (define (lambda? exp) (tagged-list? exp 'lambda))
241 (define (lambda-parameters exp) (cadr exp))
242 (define (lambda-body exp) (cddr exp))
243 (define (make-lambda parameters body)
244 (cons 'lambda (cons parameters body)))
246 (define (make-let vars vals body)
248 (cons (map list vars vals)
251 (and (tagged-list? exp 'let)
252 (not (symbol? (cadr exp)))))
253 (define (let-vars exp)
254 (map car (cadr exp)))
255 (define (let-vals exp)
256 (map cadr (cadr exp)))
257 (define (let-body exp)
259 (define (let->combination exp)
260 (make-application (make-lambda (let-vars exp) (let-body exp))
262 (define (named-let? exp)
263 (and (tagged-list? exp 'let)
264 (symbol? (cadr exp))))
265 (define (named-let-name exp)
267 (define (named-let-vars exp)
268 (map car (caddr exp)))
269 (define (named-let-vals exp)
270 (map cadr (caddr exp)))
271 (define (named-let-body exp)
273 (define (named-let->combination exp)
275 (list (make-definition (named-let-name exp)
276 (make-lambda (named-let-vars exp)
277 (named-let-body exp)))
278 (make-application (named-let-name exp)
279 (named-let-vals exp)))))
280 (define (make-named-let name vars vals body)
283 (cons (map list vars vals)
286 (define (letrec? exp)
287 (tagged-list? exp 'letrec))
289 (define (letrec-vars exp)
290 (map car (cadr exp)))
291 (define (letrec-vals exp)
292 (map cadr (cadr exp)))
293 (define (letrec-body exp)
295 (define (letrec->let exp)
296 (let* ((vars (letrec-vars exp))
297 (unassigneds (map (lambda (var) ''*unassigned*)
299 (vals (letrec-vals exp))
300 (assignments (map (lambda (var val)
301 (make-assignment var val))
304 (body (letrec-body exp)))
307 (append assignments body))))
309 (define (make-application op args)
313 (tagged-list? exp 'let*))
314 (define let*-vars let-vars)
315 (define let*-vals let-vals)
316 (define let*-body let-body)
317 (define (let*->nested-lets exp)
318 (define (expand-lets vars vals)
319 (if (null? (cdr vars))
320 (make-let (list (car vars))
323 (make-let (list (car vars))
325 (list (expand-lets (cdr vars) (cdr vals))))))
326 (let ((vars (let*-vars exp))
327 (vals (let*-vals exp)))
329 (sequence->exp (let*-body exp))
330 (expand-lets vars vals))))
334 (tagged-list? exp 'do))
335 (define (do-vars exp)
336 (map car (cadr exp)))
337 (define (do-inits exp)
338 (map cadr (cadr exp)))
339 (define (do-steps exp)
340 (map (lambda (var-init-step)
341 (if (null? (cddr var-init-step))
343 (caddr var-init-step)))
345 (define (do-test exp)
347 (define (do-expressions exp)
348 (if (null? (cdaddr exp))
351 (define (do-commands exp)
353 (define (do->combination exp)
361 (sequence->exp (do-expressions exp))
363 (append (do-commands exp)
364 (list (make-application
366 (do-steps exp)))))))))
370 (define (begin? exp) (tagged-list? exp 'begin))
371 (define (begin-actions exp) (cdr exp))
372 (define (last-exp? seq) (null? (cdr seq)))
373 (define (first-exp seq) (car seq))
374 (define (rest-exps seq) (cdr seq))
375 (define (sequence->exp seq)
376 (cond ((null? seq) seq)
377 ((last-exp? seq) (first-exp seq))
378 (else (make-begin seq))))
379 (define (make-begin seq) (cons 'begin seq))
382 (define (application? exp) (pair? exp))
383 (define (operator exp) (car exp))
384 (define (operands exp) (cdr exp))
385 (define (no-operands? ops) (null? ops))
386 (define (first-operand ops) (car ops))
387 (define (rest-operands ops) (cdr ops))
390 (define (cond? exp) (tagged-list? exp 'cond))
391 (define (cond-clauses exp) (cdr exp))
392 (define (cond-else-clause? clause)
393 (eq? (cond-predicate clause) 'else))
394 (define (cond-predicate clause) (car clause))
395 (define (cond-actions clause) (cdr clause))
396 (define (cond-extended-clause? clause)
397 (and (not (null? (cdr clause))) (eq? (cadr clause) '=>)))
398 (define (cond-extended-proc clause)
400 (define (cond->if exp)
401 (expand-clauses (cond-clauses exp)))
402 (define (expand-clauses clauses)
404 'false ; no else clause
405 (let ((first (car clauses))
406 (rest (cdr clauses)))
407 (if (cond-else-clause? first)
409 (sequence->exp (cond-actions first))
410 (error "ELSE clause isn't last -- COND->IF"
412 (if (cond-extended-clause? first)
413 (make-if (cond-predicate first)
415 (cond-extended-proc first)
416 (list (cond-predicate first)))
417 (expand-clauses rest))
418 (make-if (cond-predicate first)
419 (sequence->exp (cond-actions first))
420 (expand-clauses rest)))))))
427 (define (make-procedure parameters body env)
428 (list 'procedure parameters body env))
429 (define (scan-out-defines body)
430 (let* ((definitions (filter definition? body))
431 (vars (map definition-variable definitions))
432 (unassigneds (map (lambda (var) ''*unassigned*)
434 (vals (map definition-value definitions))
436 (map (lambda (var val)
437 (make-assignment var val))
439 (exps (remove definition? body)))
440 (if (null? definitions)
445 (append assignments exps))))))
446 (define (compound-procedure? p)
447 (tagged-list? p 'procedure))
448 (define (procedure-parameters p) (cadr p))
449 (define (procedure-body p) (caddr p))
450 (define (procedure-environment p) (cadddr p))
453 (define (enclosing-environment env) (cdr env))
454 (define (first-frame env) (car env))
455 (define the-empty-environment '())
456 (define (make-frame variables values)
457 (cons variables values))
458 (define (frame-variables frame) (car frame))
459 (define (frame-values frame) (cdr frame))
460 (define (add-binding-to-frame! var val frame)
461 (set-car! frame (cons var (car frame)))
462 (set-cdr! frame (cons val (cdr frame))))
463 (define (extend-environment vars vals base-env)
464 (if (= (length vars) (length vals))
465 (cons (make-frame vars vals) base-env)
466 (if (< (length vars) (length vals))
467 (error "Too many arguments supplied" vars vals)
468 (error "Too few arguments supplied" vars vals))))
469 (define (lookup-variable-value var env)
470 (define (env-loop env)
471 (define (scan vars vals)
473 (env-loop (enclosing-environment env)))
474 ((eq? var (car vars))
475 ;; (let ((val (car vals)))
476 ;; (if (eq? val '*unassigned*)
477 ;; (error "Var not yet defined -- LOOKUP-VARIABLE-VALUE" var)
480 (else (scan (cdr vars) (cdr vals)))))
481 (if (eq? env the-empty-environment)
482 (error "Unbound variable" var)
483 (let ((frame (first-frame env)))
484 (scan (frame-variables frame)
485 (frame-values frame)))))
487 (define (set-variable-value! var val env)
488 (define (env-loop env)
489 (define (scan vars vals)
491 (env-loop (enclosing-environment env)))
492 ((eq? var (car vars))
494 (else (scan (cdr vars) (cdr vals)))))
495 (if (eq? env the-empty-environment)
496 (error "Unbound variable -- SET!" var)
497 (let ((frame (first-frame env)))
498 (scan (frame-variables frame)
499 (frame-values frame)))))
501 (define (define-variable! var val env)
502 (let ((frame (first-frame env)))
503 (define (scan vars vals)
505 (add-binding-to-frame! var val frame))
506 ((eq? var (car vars))
508 (else (scan (cdr vars) (cdr vals)))))
509 (scan (frame-variables frame)
510 (frame-values frame))))
512 ;; (define (remove-binding-from-frame! var frame)
513 ;; (define (scan vars vals)
514 ;; (cond ((null? (cdr vars))
515 ;; (error "Binding not found -- REMOVE-BINDING-FROM-FRAME!" var))
516 ;; ((eq? var (cadr vars))
517 ;; (set-cdr! vars (cddr vars))
518 ;; (set-cdr! vals (cddr vals)))
519 ;; (else (scan (cdr vars) (cdr vals)))))
520 ;; (let ((vars (frame-variables frame))
521 ;; (vals (frame-values frame)))
522 ;; (if (eq? var (car vars))
523 ;; (begin (set-car! frame (cdr vars))
524 ;; (set-cdr! frame (cdr vals)))
525 ;; (scan vars vals))))
528 (define (primitive-procedure? proc)
529 (tagged-list? proc 'primitive))
530 (define (primitive-implementation proc) (cadr proc))
531 (define primitive-procedures
532 (list (list 'car car)
553 (list 'remainder remainder)
555 (list 'equal? equal?)
556 (list 'member member)
557 (list 'display display)
558 (list 'error error)))
559 (define (primitive-procedure-names)
561 primitive-procedures))
562 (define (primitive-procedure-objects)
563 (map (lambda (proc) (list 'primitive (cadr proc)))
564 primitive-procedures))
565 (define (apply-primitive-procedure proc args)
567 (primitive-implementation proc) args))
569 ;; execute application
571 (define (execute-application proc args succeed fail)
572 (cond ((primitive-procedure? proc)
573 (succeed (apply-primitive-procedure proc args)
575 ((compound-procedure? proc)
576 ((procedure-body proc)
577 (extend-environment (procedure-parameters proc)
579 (procedure-environment proc))
584 "Unknown procedure type -- EXECUTE-APPLICATION"
589 (define (prompt-for-input string)
590 (newline) (newline) (display string) (newline))
591 (define (announce-output string)
592 (newline) (display string) (newline))
593 (define (user-print object)
594 (if (compound-procedure? object)
595 (display (list 'compound-procedure
596 (procedure-parameters object)
597 (procedure-body object)
600 (define (setup-environment)
602 (extend-environment (primitive-procedure-names)
603 (primitive-procedure-objects)
604 the-empty-environment)))
605 (define-variable! 'true true initial-env)
606 (define-variable! 'false false initial-env)
608 (define the-global-environment (setup-environment))
610 (define input-prompt ";;; Amb-Eval input:")
611 (define output-prompt ";;; Amb-Eval value:")
612 (define (driver-loop)
613 (define (internal-loop try-again)
614 (prompt-for-input input-prompt)
615 (let ((input (read)))
616 (if (eq? input 'try-again)
620 (display ";;; Starting a new problem ")
622 the-global-environment
624 (lambda (val next-alternative)
625 (announce-output output-prompt)
627 (internal-loop next-alternative))
631 ";;; There are no more values of")
637 (display ";;; There is no current problem")
642 (define (test-case actual expected)
647 (display "Expected: ")
652 "No current problem"))
653 (define (geval exp) ;; eval globally
654 (if (eq? exp 'try-again)
657 the-global-environment
658 (lambda (val next-alternative)
659 (set! try-again next-alternative)
664 "No current problem"))
665 "No alternatives"))))
666 (define (test-eval exp expected)
667 (test-case (geval exp) expected))
672 ;; procedure definitions
675 '(define (append x y)
678 (cons (car x) (append (cdr x) y)))))
680 '(define (list-ref items n)
683 (list-ref (cdr items) (- n 1)))))
685 '(define (fold-left f init seq)
692 '(define (enumerate-interval low high)
695 (cons low (enumerate-interval (+ low 1) high)))))
697 '(define (assoc key records)
698 (cond ((null? records) false)
699 ((equal? key (caar records)) (car records))
700 (else (assoc key (cdr records))))))
703 '(define (map proc list)
706 (cons (proc (car list))
707 (map proc (cdr list))))))
709 '(define (map-2 proc l1 l2)
712 (cons (proc (car l1) (car l2))
713 (map-2 proc (cdr l1) (cdr l2))))))
716 '(define (accumulate op initial sequence)
720 (accumulate op initial (cdr sequence))))))
722 ;; ;; all special forms
723 (test-eval '(begin 5 6) 6)
725 (geval '(define x 3))
727 (test-eval '(set! x -25) 'ok)
729 (geval '(define z (lambda (x y) (+ x (* x y)))))
730 (test-eval '(z 3 4) 15)
731 (test-eval '(cond ((= x -2) 'x=-2)
735 (test-eval '(if true false true) false)
744 (geval '(define x (+ 3 8)))
745 (test-eval '(and 0 true x) 11)
746 (test-eval '(and 0 true x false) false)
747 (test-eval '(and 0 true x (set! x -2) false) false)
749 (test-eval '(and 0 true x false (set! x -5)) false)
751 (test-eval '(or false (set! x 25)) 'ok)
753 (test-eval '(or (set! x 2) (set! x 4)) 'ok)
755 (test-eval '(or false (set! x 25) true false) 'ok)
757 (test-eval '(or ((lambda (x) x) 5)) 5)
758 (test-eval '(or (begin (set! x (+ x 1)) x)) 26) ;; this fails because or->if repeats the same clause twice
760 (display "Failure expected")
766 '(cond ((assoc 'b '((a 1) (b 2))) => cadr)
771 '(cond ((= 3 4) 'not-true)
772 ((= (* 2 4) 3) 'also-false)
784 ;; procedure definition and application
786 '(define (factorial n)
789 (* n (factorial (- n 1))))))
790 (test-eval '(factorial 5) 120)
802 '(accumulate + 0 '(1 2 3 4 5))
807 (make-let '(x y) '(3 5) '((+ x y)))
834 (z (let ((a (* 3 2)))
862 (+ (let* ((x (+ y 2))
870 (a (let* ((x (* 3 x)))
886 '(let loop ((count 0))
893 (let prime-iter ((i 2))
894 (cond ((> (* i i) x) true)
895 ((= (remainder x i) 0) false)
896 (else (prime-iter (+ i 1)))))))
903 (primes (+ x 1) (- n 1))))
904 (else (primes (+ x 1) n))))
905 '(2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71))
914 (fib-iter (+ a b) a (- count 1))))))
915 (test-eval '(fib 19) 4181)
940 '(do ((y '(1 2 3 4)))
951 '(let ((x '(1 3 5 7 9)))
953 (sum 0 (+ sum (car x))))
958 (do ((x '(1 2 3 4) (cdr x))
959 (y '(1 2 3 4 5 6 7 8) (cddr y)))
961 (set! z (cons (car x) z))))
967 ;; broken now due to scan-out-defines
985 ;; '(let ((y -1) (x 3))
986 ;; (let ((y 0.5) (x 5))
995 ;; '(let ((x 3) (y 4))
1002 ;; '(let ((a 1) (b 2) (c 3) (d 4))
1003 ;; (make-unbound! b)
1008 ;; '(let ((x 4) (y 5))
1009 ;; (let ((a 1) (b 2) (c 3))
1010 ;; (let ((x (+ a b)) (y (+ c a)))
1011 ;; (make-unbound! x)
1012 ;; (let ((a x) (b (+ x y)))
1014 ;; (make-unbound! b)
1038 (test-eval '(f 5) false)
1039 (test-eval '(f 10) true)
1046 ;; signal an error because x is undefined if variables are scanned out
1063 (test-eval '(f 11) false)
1064 (test-eval '(f 16) true)
1071 (* n (fact (- n 1)))))))
1076 (test-eval '(amb 1 2 3) 1)
1077 (test-eval 'try-again 2)
1078 (test-eval 'try-again 3)
1079 (test-eval 'try-again "No alternatives")
1080 (test-eval 'try-again "No current problem")
1081 (test-eval 'try-again "No current problem")
1082 (test-eval '(amb (amb 1 2) (amb 'a 'b))
1084 (test-eval 'try-again 2)
1085 (test-eval 'try-again 'a)
1086 (test-eval 'try-again 'b)
1087 (test-eval 'try-again "No alternatives")
1088 (geval '(define (require p) (if (not p) (amb))))
1089 (test-eval '(require false) "No alternatives")
1090 (test-eval '(require true) false)
1094 '(define (an-integer-between low high)
1095 (require (<= low high))
1096 (amb low (an-integer-between (+ low 1) high))))
1099 '(define (a-pythagorean-triple-between low high)
1100 (let ((i (an-integer-between low high)))
1101 (let ((j (an-integer-between i high)))
1102 (let ((k (an-integer-between j high)))
1103 (require (= (+ (* i i) (* j j)) (* k k)))
1107 ;; '(a-pythagorean-triple-between 1 20)
1109 ;; (test-eval 'try-again '(5 12 13))
1110 ;; (test-eval 'try-again '(6 8 10))
1111 ;; (test-eval 'try-again '(8 15 17))
1112 ;; (test-eval 'try-again '(9 12 15))
1115 '(define (an-integer-starting-from low)
1116 (amb low (an-integer-starting-from (+ low 1)))))
1119 '(define (pythagorean-triples-starting-from low)
1120 (let* ((k (an-integer-starting-from low))
1121 (i (an-integer-between low k))
1122 (j (an-integer-between i k)))
1123 (require (= (+ (* i i) (* j j)) (* k k)))
1126 ;; (test-eval '(pythagorean-triples-starting-from 1)
1128 ;; (test-eval 'try-again '(6 8 10))
1129 ;; (test-eval 'try-again '(5 12 13))
1130 ;; (test-eval 'try-again '(9 12 15))
1131 ;; (test-eval 'try-again '(8 15 17))
1134 '(define (next-triplet trp)
1138 (cond ((= i j k) (list 1 1 (+ k 1)))
1139 ((= j k) (list (+ i 1) (+ i 1) k))
1140 (else (list i (+ j 1) k))))))
1142 '(define (triplet-starting-from trp)
1143 (amb trp (triplet-starting-from (next-triplet trp)))))
1145 '(define (pythagorean-triples-starting-from low)
1146 (let* ((triplet (triplet-starting-from (list low low low)))
1149 (k (caddr triplet)))
1150 (require (= (+ (* i i) (* j j)) (* k k)))
1153 '(define (distinct? items)
1154 (cond ((null? items) true)
1155 ((null? (cdr items)) true)
1156 ((member (car items) (cdr items)) false)
1157 (else (distinct? (cdr items))))))
1160 ;; Exercise 4.44. Exercise 2.42 described the ``eight-queens puzzle'' of placing queens on a chessboard so that no two attack each other. Write a nondeterministic program to solve this puzzle.
1162 ;; (define (queens queen-positions n)
1163 ;; (if (= (length queen-positions) n)
1165 ;; (let ((new-position (amb 1 2 3 4 5 6 7 8)))
1166 ;; (adjoin new-position queen-positions)
1167 ;; (require (safe? queen-positions))
1168 ;; (queens queen-positions n)
1171 '(define (queens board-size)
1172 (define (queen-cols k)
1175 (let* ((new-position (an-integer-between 1 board-size))
1177 (adjoin-position new-position k (queen-cols (- k 1)))))
1178 (require (safe? k new-positions))
1180 (queen-cols board-size)))
1182 ;; For example, '((2 4 1 3)) might represent a solution to the 4-queens problem. This represents having queens in col#1 row#2, col#2 row#4, col#3 row#1, col#4 row#3.
1184 '(define empty-board '()))
1186 ;; take positions and append new-queen-row in the (new-queen-col - 1)st position in the list
1188 '(define (adjoin-position new-queen-row new-queen-col positions)
1190 (list new-queen-row))))
1193 '(define (safe? col positions)
1194 (define (exclude-last lst)
1195 (cond ((null? lst) (error "empty list"))
1196 ((null? (cdr lst)) '())
1197 (else (cons (car lst) (exclude-last (cdr lst))))))
1198 (let ((row (list-ref positions (- col 1)))
1199 (all-but-last (exclude-last positions)))
1201 (fold-left (lambda (result next-row)
1206 (same-positive-diagonal?
1207 (fold-left (lambda (result row-col-sum)
1209 (= (+ row col) row-col-sum)))
1211 (map-2 + all-but-last (enumerate-interval 1 (- col 1)))))
1212 (same-negative-diagonal?
1213 (fold-left (lambda (result row-col-dif)
1215 (= (- row col) row-col-dif)))
1217 (map-2 - all-but-last (enumerate-interval 1 (- col 1))))))
1218 (not (or same-row? same-positive-diagonal? same-negative-diagonal?))))))
1220 (test-eval '(safe? 1 '(1)) #t)
1221 (test-eval '(safe? 4 '(2 4 1 1)) #f)
1222 (test-eval '(safe? 4 '(2 4 1 2)) #f)
1223 (test-eval '(safe? 4 '(2 4 1 3)) #t)
1224 (test-eval '(safe? 4 '(2 4 1 4)) #f)
1225 (test-eval '(safe? 7 '(2 4 6 8 3 1 1)) #f)
1226 (test-eval '(safe? 7 '(2 4 6 8 3 1 2)) #f)
1227 (test-eval '(safe? 7 '(2 4 6 8 3 1 3)) #f)
1228 (test-eval '(safe? 7 '(2 4 6 8 3 1 4)) #f)
1229 (test-eval '(safe? 7 '(2 4 6 8 3 1 5)) #f)
1230 (test-eval '(safe? 7 '(2 4 6 8 3 1 6)) #f)
1231 (test-eval '(safe? 7 '(2 4 6 8 3 1 7)) #t)
1232 (test-eval '(safe? 7 '(2 4 6 8 3 1 8)) #f)
1235 (user-print (geval '(queens 4)))
1236 (user-print (geval 'try-again))
1237 (user-print (geval 'try-again))
1238 (user-print (geval '(queens 5)))
1239 (user-print (geval 'try-again))
1240 (user-print (geval 'try-again))
1241 (user-print (geval 'try-again))
1243 ;; the procedure is really slow but it works