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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
|
; This demonstration program changed to use packages. By doing so, a
; conflict in the function name "search" is avoided.
; To play, load this file. You can then do one of three things:
; 1. execute (akalah:play ...)
; 2. execute (use-package 'akalah) or (use-package "AKALAH"), then
; you can execute (play ...)
; 3. execute (import 'akalah:play), then you can execute (play ...)
; Note that if you have defined the symbol "play" (or, for case 2, "meplay"
; as well) then you will get a correctable error. The response is to unintern
; the symbol in your current package (unintern 'play), then (continue).
; Tom Almy 8/18/95
; To play against the computer:
; (meplay #pits-per-side #pebbles-per-pit #search-depth #computer-plays-first)
;
; To have the computer play against itself:
; (play #pits-per-side #pebbles-per-pit #search-depth)
; The playing arena:
; 13 12 11 10 9 8 7
; 0 1 2 3 4 5 6
; Pick up the pile of stones in a pit and seed them counterclockwise,
; except for the oponents kalah hole.
; If the last pebble lands in your own empty hole, pick up that pebble
; and the one oposite of the opponents hole, and put them in ones kalah hole
; If the last pebble lands in your own kalah hole, play again
; If as a result of your move, you have no more pebbles, then your oponent
; takes all of his pebbles.
; The first player to get at greater than 50% of the pebbles wins.
(unless (find-package "AKALAH")
(make-package "AKALAH" :use '("XLISP")))
(in-package "AKALAH") ;; We don't have to leave this package since
;; the package is part of the environment
;; encapsulated with the LOAD function
(export '(play meplay)) ;; The only accessable functions
(shadow 'search) ;; We don't want to use the one in XLISP
(defun makelist (length contents)
(if (zerop length)
'nil
(cons contents (makelist (1- length) contents))))
(defconstant *maxvalue* 1000)
(defconstant *minvalue* (- *maxvalue*))
(defconstant *firsta* 0)
(defvar *enda*)
(defvar *endb*)
(defvar *moves*)
(defvar *firstb*)
(defvar *halfall*)
(defvar *board*)
(defvar *lasta*)
(defvar *lastb*)
(defmacro copy (list) `(append ,list 'nil))
(defmacro empty (position hole) ; empty out the given hole
`(setf (nth ,hole ,position) 0))
(defmacro kalaholefn (whoseturn) ; the scoring hole for the given player
`(if ,whoseturn *endb* *enda*))
(defmacro opposholefn (hole) ; calculate the opposing hole
`(- *lastb* ,hole))
(defmacro ownsidep (hole whoseturn)
`(if ,whoseturn (> ,hole *enda*) (< ,hole *firstb*)))
(defmacro prinb (x) `(dotimes (i ,x) (princ #\space)))
(defun search (startpos depth whoseturn)
(if (zerop depth)
(list startpos (evaluate startpos whoseturn))
(let (bestval nextval bestpos succlist)
(setq succlist (successorsfn startpos whoseturn))
(when (> depth 1) (setq succlist (reorder succlist whoseturn)))
(setq
beta *maxvalue*
bestval *minvalue*
bestpos (car succlist))
(dolist (this succlist)
(when (wincheck this whoseturn)
(return-from search (list this *maxvalue*)))
(setq nextval (- (alphabeta this
(- beta)
(- bestval)
(1- depth)
(not whoseturn))))
(when (> nextval bestval)
(setq bestval nextval)
(setq bestpos this)))
(list bestpos bestval)))) ; return value
(defun alphabeta (position alpha beta depth whoseturn)
(if (zerop depth)
(evaluate position whoseturn)
(let (bestval nextval succlist)
(setq succlist (successorsfn position whoseturn))
(when (> depth 1) (setq succlist (reorder succlist whoseturn)))
(setq bestval alpha)
(dolist (this succlist)
(when (wincheck this whoseturn)
(return-from alphabeta *maxvalue*))
(setq nextval (- (alphabeta this
(- beta)
(- bestval)
(1- depth)
(not whoseturn))))
(when (> nextval bestval) (setq bestval nextval))
(when (<= beta bestval) (return-from alphabeta bestval)))
bestval)))
(defun successorsfn (position whoseturn
&aux
(picuphole (1- (if whoseturn *firstb* *firsta*)))
succlist
succ
stones
disthole
lasthole)
(dotimes (dummy *enda*)
(when (not (zerop (nth (setq picuphole (1+ picuphole)) position)))
(setq succ (copy position))
(setf (nth *moves* succ)
(cons (1+ dummy) (nth *moves* succ)))
(setq stones (nth picuphole succ)) ; stones in this pit
(empty succ picuphole)
(setq disthole picuphole)
(dotimes (dummy2 stones) ; drop in successive holes except
; opponents kalah hole
(setq disthole (nextdistholefn disthole whoseturn))
(dropin succ disthole 1))
(setq lasthole disthole)
(cond ((allownzerok succ whoseturn) ; all played out
(opptakesallfn succ whoseturn))
((eq lasthole (kalaholefn whoseturn)) ; last in kalah
(setq succ (successorsfn succ whoseturn)))
((and (eq (nth lasthole succ) 1) ; last into own empty
(> (nth (opposholefn lasthole) succ) 0)
(ownsidep lasthole whoseturn))
(dropin succ
(kalaholefn whoseturn)
(1+ (nth (opposholefn lasthole) succ)))
(empty succ lasthole)
(empty succ (opposholefn lasthole))
(when (allownzerok succ whoseturn)
(opptakesallfn succ whoseturn))))
(setq succlist (nconc (preparelisfn succ) succlist))))
(if (null succlist)
(progn (setq succ (copy position))
(opptakesallfn succ whoseturn)
(list succ))
succlist))
(defun dropin (position hole number)
(setf (nth hole position)
(+ number
(nth hole position))))
(defun nextdistholefn (disthole whoseturn)
(cond ((and whoseturn (eql disthole *lasta*)) *firstb*) ; skip own pile
((and (not whoseturn) (eql disthole *lastb*)) *firsta*)
((< disthole *endb*) (1+ disthole))
(t *firsta*)))
(defun preparelisfn (x)
(if (atom (car x))
(list x)
(unimbedfn x)))
(defun reorder (poslist whoseturn)
(mapcar #'car (sort (mapcar #'(lambda (x)
(cons x
(evaluate x whoseturn)))
poslist)
#'(lambda (x y) (>= (cdr x) (cdr y))))))
(defun wincheck (position whoseturn)
(> (nth (kalaholefn whoseturn) position) *halfall*))
(defun evaluate (position whoseturn) ; assign the value to the position
; could obviously use work
(let ((ownkala (nth (kalaholefn whoseturn) position))
(oppkala (nth (kalaholefn (not whoseturn)) position)))
(cond ((> ownkala *halfall*) *maxvalue*)
((> oppkala *halfall*) *minvalue*)
(t (- ownkala oppkala)))))
(defun printins ()
(terpri)
(format t "Select Hole:~% ")
(dotimes (i *enda*)
(let ((n (- *enda* i)))
(prin1 n)
(prinb (if (> 10 n) 2 1))
)))
(defun listmoves (position &aux (l (nth *moves* position)))
(setf (nth *moves* position) nil)
(terpri)
(format t "Moves: ")
(mapc #'(lambda (x) (format t "~s " x)) (reverse l)))
(defun printpos (position)
(let ((minprint (reverse (subseq position 0 *firstb*)))
(maxprint (subseq position *firstb* *moves*)))
(terpri)
(prin1 (car minprint))
(prinb (if (> 10 (car minprint)) 3 2))
(setq minprint (cdr minprint))
(do ((list minprint (cdr list)))
((null list))
(prin1 (car list))
(prinb (if (> 10 (car list)) 2 1)))
(terpri)
(prinb 4)
(do ((list maxprint (cdr list)))
((null (cdr list)))
(prin1 (car list))
(prinb (if (> 10 (car list)) 2 1)))
(prinb 2)
(prin1 (car (last maxprint)))
(terpri)
(terpri)))
(defun allownzerok (position whoseturn)
(zerop (apply #'+ (if whoseturn
(subseq position *firstb* *endb*)
(subseq position *firsta* *enda*)))))
(defun opptakesallfn (position whoseturn)
(dropin position
(kalaholefn (not whoseturn))
(apply #'+ (if whoseturn
(subseq position *firsta* *enda*)
(subseq position *firstb* *endb*))))
(do ((count *enda* (1- count))
(hole (if whoseturn *firsta* *firstb*) (1+ hole)))
((zerop count))
(empty position hole)))
(defun nextmove (depth whoseturn)
(terpri)
(setq *board* (search (car *board*) depth whoseturn))
(listmoves (car *board*))
(printpos (car *board*))
(print (cdr *board*))
(terpri))
(defun unimbedfn (poslist)
(do ((list poslist (cdr list))
(result nil (if (atom (caar list))
(cons (car list) result)
(append (unimbedfn (car list)) result))))
((null list) result)))
(defun initialize (holes pebbles
&aux (temp (makelist holes pebbles)))
; initialize the playing area
(setq *enda* holes
*endb* (+ holes holes 1)
*lasta* (1- *enda* )
*firstb* (1+ *enda*)
*lastb* (1- *endb*)
*moves* (1+ *endb*)
*halfall* (* holes pebbles)
*board* (list (append temp
(list 0)
temp
(list 0)
'(nil))
0)))
(defun play (holes pebbles depth) ; play the game
(initialize holes pebbles)
(do ((whoseturn nil (not whoseturn))
(scorea 0 (nth *enda* (car *board*)))
(scoreb 0 (nth *endb* (car *board*))))
((or (> scorea *halfall*)
(> scoreb *halfall*)
(= scorea scoreb *halfall*)))
(nextmove depth whoseturn)))
(defun meplay (holes pebbles depth computer-first)
(prog (picuphole)
(initialize holes pebbles)
(when computer-first (setq succ (copy (car *board*)))
(go y))
n (setq succ (copy (car *board*)))
(printins)
(printpos succ)
(when (> (nth *enda* succ) *halfall*)
(format t "You win!!~%")
(return t)) ; win for side a
(when (> (nth *endb* succ) *halfall*)
(format t "I win!!!~%")
(return nil)) ; win for side b
(when (= (nth *enda* succ) (nth *endb* succ) *halfall*)
(format t "We tie???~%")
(return nil))
x (princ "Hole? ") (setq picuphole (read))
(when (or (not (numberp picuphole))
(>= picuphole *firstb*)
(> 1 picuphole)
(zerop (setq stones
(nth (setq picuphole (1- picuphole)) succ))))
(go x))
(empty succ picuphole)
(setq disthole picuphole)
(dotimes (dummy stones)
(dropin succ
(setq disthole (nextdistholefn disthole nil)) 1))
(setq lasthole disthole)
(cond ((allownzerok succ nil)
(opptakesallfn succ nil)
(setq *board* (list succ 0))
(go n))
((eql lasthole *enda*)
(setq *board* (list succ 0))
(go n))
((and (eql (nth lasthole succ) 1)
(> (nth (opposholefn lasthole) succ) 0)
(> *enda* lasthole))
(dropin succ *enda* (1+ (nth (opposholefn lasthole) succ)))
(empty succ lasthole)
(empty succ (opposholefn lasthole))
(when (allownzerok succ nil)
(opptakesallfn succ nil)
(setq *board* (list succ 0))
(go n))))
(printpos succ)
y (format t "(Computer is thinking...)~%")
(setq *board* (search succ depth t))
(listmoves (car *board*))
(go n)))
|
