-
Notifications
You must be signed in to change notification settings - Fork 0
/
puzzle.sc
151 lines (132 loc) · 4.47 KB
/
puzzle.sc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; File: puzzle.sc
;;; Description: PUZZLE benchmark
;;; Author: Richard Gabriel, after Forrest Baskett
;;; Created: 12-Apr-85
;;; Modified: 12-Apr-85 14:20:23 (Bob Shaw)
;;; 11-Aug-87 (Will Clinger)
;;; 22-Jan-88 (Will Clinger)
;;; 8-Oct-95 (Qobi)
;;; 31-Mar-98 (Qobi)
;;; Language: Scheme
;;; Status: Public Domain
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(define (run)
(define (iota n)
(do ((n n (- n 1)) (list '() (cons (- n 1) list))) ((zero? n) list)))
;; PUZZLE -- Forest Baskett's Puzzle benchmark, originally written in Pascal.
(define size 511)
(define classmax 3)
(define typemax 12)
(define *iii* 0)
(define *kount* 0)
(define *d* 8)
(define *piececount* (make-vector (+ classmax 1) 0))
(define *class* (make-vector (+ typemax 1) 0))
(define *piecemax* (make-vector (+ typemax 1) 0))
(define *puzzle* (make-vector (+ size 1)))
(define *p* (make-vector (+ typemax 1)))
(define (fit i j)
(let ((end (vector-ref *piecemax* i)))
(do ((k 0 (+ k 1)))
((or (> k end)
(and (vector-ref (vector-ref *p* i) k)
(vector-ref *puzzle* (+ j k))))
(if (> k end) #t #f))))) ;Qobi: resist temptation to optimize
(define (place i j)
(let ((end (vector-ref *piecemax* i)))
(do ((k 0 (+ k 1))) ((> k end))
(cond ((vector-ref (vector-ref *p* i) k)
(vector-set! *puzzle* (+ j k) #t)
#t)))
(vector-set! *piececount*
(vector-ref *class* i)
(- (vector-ref *piececount* (vector-ref *class* i)) 1))
(do ((k j (+ k 1)))
((or (> k size) (not (vector-ref *puzzle* k)))
;;(newline)
;;(display "*Puzzle* filled")
(if (> k size) 0 k)))))
(define (puzzle-remove i j)
(let ((end (vector-ref *piecemax* i)))
(do ((k 0 (+ k 1))) ((> k end))
(cond ((vector-ref (vector-ref *p* i) k)
(vector-set! *puzzle* (+ j k) #f)
#f)))
(vector-set! *piececount*
(vector-ref *class* i)
(+ (vector-ref *piececount* (vector-ref *class* i)) 1))))
(define (trial j)
(let ((k 0))
(call-with-current-continuation
(lambda (return)
;; Qobi: changed () to #F in the following
(do ((i 0 (+ i 1))) ((> i typemax) (set! *kount* (+ *kount* 1)) #f)
(cond ((not (zero? (vector-ref *piececount* (vector-ref *class* i))))
(cond ((fit i j)
(set! k (place i j))
(cond ((or (trial k) (zero? k))
;;(trial-output (+ i 1) (+ k 1))
(set! *kount* (+ *kount* 1))
(return #t))
(else (puzzle-remove i j))))))))))))
(define (trial-output x y) ;Qobi: removed R3RS NUMBER->STRING
(newline)
(display "Piece ")
(display x)
(display " at ")
(display y)
(display "."))
(define (definePiece iclass ii jj kk)
(let ((index 0))
(do ((i 0 (+ i 1))) ((> i ii))
(do ((j 0 (+ j 1))) ((> j jj))
(do ((k 0 (+ k 1))) ((> k kk))
(set! index (+ i (* *d* (+ j (* *d* k)))))
(vector-set! (vector-ref *p* *iii*) index #t))))
(vector-set! *class* *iii* iclass)
(vector-set! *piecemax* *iii* index)
(cond ((not (= *iii* typemax)) (set! *iii* (+ *iii* 1))))))
(define (start)
(do ((m 0 (+ m 1))) ((> m size)) (vector-set! *puzzle* m #t))
(do ((i 1 (+ i 1))) ((> i 5))
(do ((j 1 (+ j 1))) ((> j 5))
(do ((k 1 (+ k 1))) ((> k 5))
(vector-set! *puzzle* (+ i (* *d* (+ j (* *d* k)))) #f))))
(do ((i 0 (+ i 1))) ((> i typemax))
(do ((m 0 (+ m 1))) ((> m size))
(vector-set! (vector-ref *p* i) m #f)))
(set! *iii* 0)
(definePiece 0 3 1 0)
(definePiece 0 1 0 3)
(definePiece 0 0 3 1)
(definePiece 0 1 3 0)
(definePiece 0 3 0 1)
(definePiece 0 0 1 3)
(definePiece 1 2 0 0)
(definePiece 1 0 2 0)
(definePiece 1 0 0 2)
(definePiece 2 1 1 0)
(definePiece 2 1 0 1)
(definePiece 2 0 1 1)
(definePiece 3 1 1 1)
(vector-set! *piececount* 0 13)
(vector-set! *piececount* 1 3)
(vector-set! *piececount* 2 1)
(vector-set! *piececount* 3 1)
(let ((m (+ (* *d* (+ *d* 1)) 1))
(n 0))
(cond ((fit 0 m) (set! n (place 0 m)))
(else (newline) (display "Error."))) ;Qobi: removed BEGIN
(cond ((trial n) ;Qobi: removed BEGIN
(newline)
(display "Success in ")
(write *kount*)
(display " trials."))
(else (newline) (display "Failure."))))) ;Qobi: removed BEGIN
;; Qobi: moved
(for-each (lambda (i) (vector-set! *p* i (make-vector (+ size 1))))
(iota (+ typemax 1)))
(start)
(newline)) ;Qobi: added
(do ((i 0 (+ i 1))) ((= i 1000)) (run))