17905
|
1 ;;;_* landmark.el --- Landmark learning neural network
|
|
2 ;; Copyright (C) 1996 Free Software Foundation, Inc.
|
|
3
|
|
4 ;; Author: Terrence Brannon <brannon@rana.usc.edu>
|
|
5 ;; Maintainer: same
|
|
6 ;; Created: December 16, 1996 - first release to usenet
|
|
7 ;; Keywords: gomoku neural network adaptive search chemotaxis
|
|
8
|
|
9 ;; This file is part of GNU Emacs.
|
|
10
|
|
11 ;; GNU Emacs is free software; you can redistribute it and/or modify
|
|
12 ;; it under the terms of the GNU General Public License as published by
|
|
13 ;; the Free Software Foundation; either version 2, or (at your option)
|
|
14 ;; any later version.
|
|
15
|
|
16 ;; GNU Emacs is distributed in the hope that it will be useful,
|
|
17 ;; but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
18 ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
19 ;; GNU General Public License for more details.
|
|
20
|
|
21 ;; You should have received a copy of the GNU General Public License
|
|
22 ;; along with GNU Emacs; see the file COPYING. If not, write to the
|
|
23 ;; Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
24 ;; Boston, MA 02111-1307, USA.
|
|
25
|
|
26 ;;;_* Usage
|
|
27 ;;; Just type
|
|
28 ;;; M-x eval-current-buffer
|
|
29 ;;; M-x lm-test-run
|
|
30
|
|
31 ;;;_* Commentary
|
|
32 ;;; Lm is a relatively non-participatory game in which a robot
|
|
33 ;;; attempts to maneuver towards a tree at the center of the window
|
|
34 ;;; based on unique olfactory cues from each of the 4 directions. If
|
|
35 ;;; the smell of the tree increases, then the weights in the robot's
|
|
36 ;;; brain are adjusted to encourage this odor-driven behavior in the
|
|
37 ;;; future. If the smell of the tree decreases, the robots weights are
|
|
38 ;;; adjusted to discourage a correct move.
|
|
39
|
|
40 ;;; In layman's terms, the search space is initially flat. The point
|
|
41 ;;; of training is to "turn up the edges of the search space" so that
|
|
42 ;;; the robot rolls toward the center.
|
|
43
|
|
44 ;;; Further, do not become alarmed if the robot appears to oscillate
|
|
45 ;;; back and forth between two or a few positions. This simply means
|
|
46 ;;; it is currently caught in a local minimum and is doing its best to
|
|
47 ;;; work its way out.
|
|
48
|
|
49 ;;; The version of this program as described has a small problem. a
|
|
50 ;;; move in a net direction can produce gross credit assignment. for
|
|
51 ;;; example, if moving south will produce positive payoff, then, if in
|
|
52 ;;; a single move, one moves east,west and south, then both east and
|
|
53 ;;; west will be improved when they shouldn't
|
|
54
|
|
55 ;;; For further references see
|
|
56 ;;; http://rana.usc.edu:8376/~yuri/CS564/hw5.html
|
|
57
|
|
58
|
|
59
|
|
60
|
|
61
|
|
62
|
|
63
|
|
64
|
|
65
|
|
66
|
|
67
|
|
68 ;;;_* Provide
|
|
69
|
|
70 (provide 'lm)
|
|
71
|
|
72
|
|
73
|
|
74
|
|
75
|
|
76
|
|
77
|
|
78 ;;;_* Require
|
|
79 (require 'cl)
|
|
80
|
|
81
|
|
82
|
|
83
|
|
84
|
|
85
|
|
86 ;;;_* From Gomoku
|
|
87
|
|
88
|
|
89
|
|
90
|
|
91
|
|
92 ;;;_ + THE BOARD.
|
|
93
|
|
94
|
|
95 ;; The board is a rectangular grid. We code empty squares with 0, X's with 1
|
|
96 ;; and O's with 6. The rectangle is recorded in a one dimensional vector
|
|
97 ;; containing padding squares (coded with -1). These squares allow us to
|
|
98 ;; detect when we are trying to move out of the board. We denote a square by
|
|
99 ;; its (X,Y) coords, or by the INDEX corresponding to them in the vector. The
|
|
100 ;; leftmost topmost square has coords (1,1) and index lm-board-width + 2.
|
|
101 ;; Similarly, vectors between squares may be given by two DX, DY coords or by
|
|
102 ;; one DEPL (the difference between indexes).
|
|
103
|
|
104 (defvar lm-board-width nil
|
|
105 "Number of columns on the Lm board.")
|
|
106 (defvar lm-board-height nil
|
|
107 "Number of lines on the Lm board.")
|
|
108
|
|
109 (defvar lm-board nil
|
|
110 "Vector recording the actual state of the Lm board.")
|
|
111
|
|
112 (defvar lm-vector-length nil
|
|
113 "Length of lm-board vector.")
|
|
114
|
|
115 (defvar lm-draw-limit nil
|
|
116 ;; This is usually set to 70% of the number of squares.
|
|
117 "After how many moves will Emacs offer a draw?")
|
|
118
|
|
119 (defun lm-xy-to-index (x y)
|
|
120 "Translate X, Y cartesian coords into the corresponding board index."
|
|
121 (+ (* y lm-board-width) x y))
|
|
122
|
|
123 (defun lm-index-to-x (index)
|
|
124 "Return corresponding x-coord of board INDEX."
|
|
125 (% index (1+ lm-board-width)))
|
|
126
|
|
127 (defun lm-index-to-y (index)
|
|
128 "Return corresponding y-coord of board INDEX."
|
|
129 (/ index (1+ lm-board-width)))
|
|
130
|
|
131 (defun lm-init-board ()
|
|
132 "Create the lm-board vector and fill it with initial values."
|
|
133 (setq lm-board (make-vector lm-vector-length 0))
|
|
134 ;; Every square is 0 (i.e. empty) except padding squares:
|
|
135 (let ((i 0) (ii (1- lm-vector-length)))
|
|
136 (while (<= i lm-board-width) ; The squares in [0..width] and in
|
|
137 (aset lm-board i -1) ; [length - width - 1..length - 1]
|
|
138 (aset lm-board ii -1) ; are padding squares.
|
|
139 (setq i (1+ i)
|
|
140 ii (1- ii))))
|
|
141 (let ((i 0))
|
|
142 (while (< i lm-vector-length)
|
|
143 (aset lm-board i -1) ; and also all k*(width+1)
|
|
144 (setq i (+ i lm-board-width 1)))))
|
|
145
|
|
146
|
|
147
|
|
148
|
|
149
|
|
150 ;;;_ + LM MODE AND KEYMAP.
|
|
151
|
|
152 (defvar lm-mode-hook nil
|
|
153 "If non-nil, its value is called on entry to Lm mode.")
|
|
154
|
|
155 (defvar lm-mode-map nil
|
|
156 "Local keymap to use in Lm mode.")
|
|
157
|
|
158 (if lm-mode-map nil
|
|
159 (setq lm-mode-map (make-sparse-keymap))
|
|
160
|
|
161 ;; Key bindings for cursor motion.
|
|
162 (define-key lm-mode-map "y" 'lm-move-nw) ; y
|
|
163 (define-key lm-mode-map "u" 'lm-move-ne) ; u
|
|
164 (define-key lm-mode-map "b" 'lm-move-sw) ; b
|
|
165 (define-key lm-mode-map "n" 'lm-move-se) ; n
|
|
166 (define-key lm-mode-map "h" 'backward-char) ; h
|
|
167 (define-key lm-mode-map "l" 'forward-char) ; l
|
|
168 (define-key lm-mode-map "j" 'lm-move-down) ; j
|
|
169 (define-key lm-mode-map "k" 'lm-move-up) ; k
|
|
170
|
|
171 (define-key lm-mode-map [kp-7] 'lm-move-nw)
|
|
172 (define-key lm-mode-map [kp-9] 'lm-move-ne)
|
|
173 (define-key lm-mode-map [kp-1] 'lm-move-sw)
|
|
174 (define-key lm-mode-map [kp-3] 'lm-move-se)
|
|
175 (define-key lm-mode-map [kp-4] 'backward-char)
|
|
176 (define-key lm-mode-map [kp-6] 'forward-char)
|
|
177 (define-key lm-mode-map [kp-2] 'lm-move-down)
|
|
178 (define-key lm-mode-map [kp-8] 'lm-move-up)
|
|
179
|
|
180 (define-key lm-mode-map "\C-n" 'lm-move-down) ; C-n
|
|
181 (define-key lm-mode-map "\C-p" 'lm-move-up) ; C-p
|
|
182
|
|
183 ;; Key bindings for entering Human moves.
|
|
184 (define-key lm-mode-map "X" 'lm-human-plays) ; X
|
|
185 (define-key lm-mode-map "x" 'lm-human-plays) ; x
|
|
186
|
|
187 (define-key lm-mode-map " " 'lm-start-robot) ; SPC
|
|
188 (define-key lm-mode-map [down-mouse-1] 'lm-start-robot)
|
|
189 (define-key lm-mode-map [drag-mouse-1] 'lm-click)
|
|
190 (define-key lm-mode-map [mouse-1] 'lm-click)
|
|
191 (define-key lm-mode-map [down-mouse-2] 'lm-click)
|
|
192 (define-key lm-mode-map [mouse-2] 'lm-mouse-play)
|
|
193 (define-key lm-mode-map [drag-mouse-2] 'lm-mouse-play)
|
|
194
|
|
195 (substitute-key-definition 'previous-line 'lm-move-up
|
|
196 lm-mode-map (current-global-map))
|
|
197 (substitute-key-definition 'next-line 'lm-move-down
|
|
198 lm-mode-map (current-global-map))
|
|
199 (substitute-key-definition 'beginning-of-line 'lm-beginning-of-line
|
|
200 lm-mode-map (current-global-map))
|
|
201 (substitute-key-definition 'end-of-line 'lm-end-of-line
|
|
202 lm-mode-map (current-global-map))
|
|
203 (substitute-key-definition 'undo 'lm-human-takes-back
|
|
204 lm-mode-map (current-global-map))
|
|
205 (substitute-key-definition 'advertised-undo 'lm-human-takes-back
|
|
206 lm-mode-map (current-global-map)))
|
|
207
|
|
208 (defvar lm-emacs-won ()
|
|
209 "*For making font-lock use the winner's face for the line.")
|
|
210
|
|
211 (defvar lm-font-lock-O-face
|
|
212 (if window-system
|
|
213 (list (facemenu-get-face 'fg:red) 'bold))
|
|
214 "*Face to use for Emacs' O.")
|
|
215
|
|
216 (defvar lm-font-lock-X-face
|
|
217 (if window-system
|
|
218 (list (facemenu-get-face 'fg:green) 'bold))
|
|
219 "*Face to use for your X.")
|
|
220
|
|
221 (defvar lm-font-lock-keywords
|
|
222 '(("O" . lm-font-lock-O-face)
|
|
223 ("X" . lm-font-lock-X-face)
|
|
224 ("[-|/\\]" 0 (if lm-emacs-won
|
|
225 lm-font-lock-O-face
|
|
226 lm-font-lock-X-face)))
|
|
227 "*Font lock rules for Lm.")
|
|
228
|
|
229 (put 'lm-mode 'front-sticky
|
|
230 (put 'lm-mode 'rear-nonsticky '(intangible)))
|
|
231 (put 'lm-mode 'intangible 1)
|
|
232
|
|
233 (defun lm-mode ()
|
|
234 "Major mode for playing Lm against Emacs.
|
|
235 You and Emacs play in turn by marking a free square. You mark it with X
|
|
236 and Emacs marks it with O. The winner is the first to get five contiguous
|
|
237 marks horizontally, vertically or in diagonal.
|
|
238
|
|
239 You play by moving the cursor over the square you choose and hitting \\[lm-human-plays].
|
|
240
|
|
241 Other useful commands:
|
|
242 \\{lm-mode-map}
|
|
243 Entry to this mode calls the value of `lm-mode-hook' if that value
|
|
244 is non-nil. One interesting value is `turn-on-font-lock'."
|
|
245 (interactive)
|
|
246 (setq major-mode 'lm-mode
|
|
247 mode-name "Lm")
|
|
248 (lm-display-statistics)
|
|
249 (use-local-map lm-mode-map)
|
|
250 (make-local-variable 'font-lock-defaults)
|
|
251 (setq font-lock-defaults '(lm-font-lock-keywords t))
|
|
252 (toggle-read-only t)
|
|
253 (run-hooks 'lm-mode-hook))
|
|
254
|
|
255
|
|
256
|
|
257
|
|
258
|
|
259 ;;;_ + THE SCORE TABLE.
|
|
260
|
|
261
|
|
262 ;; Every (free) square has a score associated to it, recorded in the
|
|
263 ;; LM-SCORE-TABLE vector. The program always plays in the square having
|
|
264 ;; the highest score.
|
|
265
|
|
266 (defvar lm-score-table nil
|
|
267 "Vector recording the actual score of the free squares.")
|
|
268
|
|
269
|
|
270 ;; The key point point about the algorithm is that, rather than considering
|
|
271 ;; the board as just a set of squares, we prefer to see it as a "space" of
|
|
272 ;; internested 5-tuples of contiguous squares (called qtuples).
|
|
273 ;;
|
|
274 ;; The aim of the program is to fill one qtuple with its O's while preventing
|
|
275 ;; you from filling another one with your X's. To that effect, it computes a
|
|
276 ;; score for every qtuple, with better qtuples having better scores. Of
|
|
277 ;; course, the score of a qtuple (taken in isolation) is just determined by
|
|
278 ;; its contents as a set, i.e. not considering the order of its elements. The
|
|
279 ;; highest score is given to the "OOOO" qtuples because playing in such a
|
|
280 ;; qtuple is winning the game. Just after this comes the "XXXX" qtuple because
|
|
281 ;; not playing in it is just loosing the game, and so on. Note that a
|
|
282 ;; "polluted" qtuple, i.e. one containing at least one X and at least one O,
|
|
283 ;; has score zero because there is no more any point in playing in it, from
|
|
284 ;; both an attacking and a defending point of view.
|
|
285 ;;
|
|
286 ;; Given the score of every qtuple, the score of a given free square on the
|
|
287 ;; board is just the sum of the scores of all the qtuples to which it belongs,
|
|
288 ;; because playing in that square is playing in all its containing qtuples at
|
|
289 ;; once. And it is that function which takes into account the internesting of
|
|
290 ;; the qtuples.
|
|
291 ;;
|
|
292 ;; This algorithm is rather simple but anyway it gives a not so dumb level of
|
|
293 ;; play. It easily extends to "n-dimensional Lm", where a win should not
|
|
294 ;; be obtained with as few as 5 contiguous marks: 6 or 7 (depending on n !)
|
|
295 ;; should be preferred.
|
|
296
|
|
297
|
|
298 ;; Here are the scores of the nine "non-polluted" configurations. Tuning
|
|
299 ;; these values will change (hopefully improve) the strength of the program
|
|
300 ;; and may change its style (rather aggressive here).
|
|
301
|
|
302 (defconst nil-score 7 "Score of an empty qtuple.")
|
|
303 (defconst Xscore 15 "Score of a qtuple containing one X.")
|
|
304 (defconst XXscore 400 "Score of a qtuple containing two X's.")
|
|
305 (defconst XXXscore 1800 "Score of a qtuple containing three X's.")
|
|
306 (defconst XXXXscore 100000 "Score of a qtuple containing four X's.")
|
|
307 (defconst Oscore 35 "Score of a qtuple containing one O.")
|
|
308 (defconst OOscore 800 "Score of a qtuple containing two O's.")
|
|
309 (defconst OOOscore 15000 "Score of a qtuple containing three O's.")
|
|
310 (defconst OOOOscore 800000 "Score of a qtuple containing four O's.")
|
|
311
|
|
312 ;; These values are not just random: if, given the following situation:
|
|
313 ;;
|
|
314 ;; . . . . . . . O .
|
|
315 ;; . X X a . . . X .
|
|
316 ;; . . . X . . . X .
|
|
317 ;; . . . X . . . X .
|
|
318 ;; . . . . . . . b .
|
|
319 ;;
|
|
320 ;; you want Emacs to play in "a" and not in "b", then the parameters must
|
|
321 ;; satisfy the inequality:
|
|
322 ;;
|
|
323 ;; 6 * XXscore > XXXscore + XXscore
|
|
324 ;;
|
|
325 ;; because "a" mainly belongs to six "XX" qtuples (the others are less
|
|
326 ;; important) while "b" belongs to one "XXX" and one "XX" qtuples. Other
|
|
327 ;; conditions are required to obtain sensible moves, but the previous example
|
|
328 ;; should illustrate the point. If you manage to improve on these values,
|
|
329 ;; please send me a note. Thanks.
|
|
330
|
|
331
|
|
332 ;; As we chose values 0, 1 and 6 to denote empty, X and O squares, the
|
|
333 ;; contents of a qtuple are uniquely determined by the sum of its elements and
|
|
334 ;; we just have to set up a translation table.
|
|
335
|
|
336 (defconst lm-score-trans-table
|
|
337 (vector nil-score Xscore XXscore XXXscore XXXXscore 0
|
|
338 Oscore 0 0 0 0 0
|
|
339 OOscore 0 0 0 0 0
|
|
340 OOOscore 0 0 0 0 0
|
|
341 OOOOscore 0 0 0 0 0
|
|
342 0)
|
|
343 "Vector associating qtuple contents to their score.")
|
|
344
|
|
345
|
|
346 ;; If you do not modify drastically the previous constants, the only way for a
|
|
347 ;; square to have a score higher than OOOOscore is to belong to a "OOOO"
|
|
348 ;; qtuple, thus to be a winning move. Similarly, the only way for a square to
|
|
349 ;; have a score between XXXXscore and OOOOscore is to belong to a "XXXX"
|
|
350 ;; qtuple. We may use these considerations to detect when a given move is
|
|
351 ;; winning or loosing.
|
|
352
|
|
353 (defconst lm-winning-threshold OOOOscore
|
|
354 "Threshold score beyond which an Emacs move is winning.")
|
|
355
|
|
356 (defconst lm-loosing-threshold XXXXscore
|
|
357 "Threshold score beyond which a human move is winning.")
|
|
358
|
|
359
|
|
360 (defun lm-strongest-square ()
|
|
361 "Compute index of free square with highest score, or nil if none."
|
|
362 ;; We just have to loop other all squares. However there are two problems:
|
|
363 ;; 1/ The SCORE-TABLE only gives correct scores to free squares. To speed
|
|
364 ;; up future searches, we set the score of padding or occupied squares
|
|
365 ;; to -1 whenever we meet them.
|
|
366 ;; 2/ We want to choose randomly between equally good moves.
|
|
367 (let ((score-max 0)
|
|
368 (count 0) ; Number of equally good moves
|
|
369 (square (lm-xy-to-index 1 1)) ; First square
|
|
370 (end (lm-xy-to-index lm-board-width lm-board-height))
|
|
371 best-square score)
|
|
372 (while (<= square end)
|
|
373 (cond
|
|
374 ;; If score is lower (i.e. most of the time), skip to next:
|
|
375 ((< (aref lm-score-table square) score-max))
|
|
376 ;; If score is better, beware of non free squares:
|
|
377 ((> (setq score (aref lm-score-table square)) score-max)
|
|
378 (if (zerop (aref lm-board square)) ; is it free ?
|
|
379 (setq count 1 ; yes: take it !
|
|
380 best-square square
|
|
381 score-max score)
|
|
382 (aset lm-score-table square -1))) ; no: kill it !
|
|
383 ;; If score is equally good, choose randomly. But first check freeness:
|
|
384 ((not (zerop (aref lm-board square)))
|
|
385 (aset lm-score-table square -1))
|
|
386 ((zerop (random (setq count (1+ count))))
|
|
387 (setq best-square square
|
|
388 score-max score)))
|
|
389 (setq square (1+ square))) ; try next square
|
|
390 best-square))
|
|
391
|
|
392 ;;;_ - INITIALIZING THE SCORE TABLE.
|
|
393
|
|
394 ;; At initialization the board is empty so that every qtuple amounts for
|
|
395 ;; nil-score. Therefore, the score of any square is nil-score times the number
|
|
396 ;; of qtuples that pass through it. This number is 3 in a corner and 20 if you
|
|
397 ;; are sufficiently far from the sides. As computing the number is time
|
|
398 ;; consuming, we initialize every square with 20*nil-score and then only
|
|
399 ;; consider squares at less than 5 squares from one side. We speed this up by
|
|
400 ;; taking symmetry into account.
|
|
401 ;; Also, as it is likely that successive games will be played on a board with
|
|
402 ;; same size, it is a good idea to save the initial SCORE-TABLE configuration.
|
|
403
|
|
404 (defvar lm-saved-score-table nil
|
|
405 "Recorded initial value of previous score table.")
|
|
406
|
|
407 (defvar lm-saved-board-width nil
|
|
408 "Recorded value of previous board width.")
|
|
409
|
|
410 (defvar lm-saved-board-height nil
|
|
411 "Recorded value of previous board height.")
|
|
412
|
|
413
|
|
414 (defun lm-init-score-table ()
|
|
415 "Create the score table vector and fill it with initial values."
|
|
416 (if (and lm-saved-score-table ; Has it been stored last time ?
|
|
417 (= lm-board-width lm-saved-board-width)
|
|
418 (= lm-board-height lm-saved-board-height))
|
|
419 (setq lm-score-table (copy-sequence lm-saved-score-table))
|
|
420 ;; No, compute it:
|
|
421 (setq lm-score-table
|
|
422 (make-vector lm-vector-length (* 20 nil-score)))
|
|
423 (let (i j maxi maxj maxi2 maxj2)
|
|
424 (setq maxi (/ (1+ lm-board-width) 2)
|
|
425 maxj (/ (1+ lm-board-height) 2)
|
|
426 maxi2 (min 4 maxi)
|
|
427 maxj2 (min 4 maxj))
|
|
428 ;; We took symmetry into account and could use it more if the board
|
|
429 ;; would have been square and not rectangular !
|
|
430 ;; In our case we deal with all (i,j) in the set [1..maxi2]*[1..maxj] U
|
|
431 ;; [maxi2+1..maxi]*[1..maxj2]. Maxi2 and maxj2 are used because the
|
|
432 ;; board may well be less than 8 by 8 !
|
|
433 (setq i 1)
|
|
434 (while (<= i maxi2)
|
|
435 (setq j 1)
|
|
436 (while (<= j maxj)
|
|
437 (lm-init-square-score i j)
|
|
438 (setq j (1+ j)))
|
|
439 (setq i (1+ i)))
|
|
440 (while (<= i maxi)
|
|
441 (setq j 1)
|
|
442 (while (<= j maxj2)
|
|
443 (lm-init-square-score i j)
|
|
444 (setq j (1+ j)))
|
|
445 (setq i (1+ i))))
|
|
446 (setq lm-saved-score-table (copy-sequence lm-score-table)
|
|
447 lm-saved-board-width lm-board-width
|
|
448 lm-saved-board-height lm-board-height)))
|
|
449
|
|
450 (defun lm-nb-qtuples (i j)
|
|
451 "Return the number of qtuples containing square I,J."
|
|
452 ;; This function is complicated because we have to deal
|
|
453 ;; with ugly cases like 3 by 6 boards, but it works.
|
|
454 ;; If you have a simpler (and correct) solution, send it to me. Thanks !
|
|
455 (let ((left (min 4 (1- i)))
|
|
456 (right (min 4 (- lm-board-width i)))
|
|
457 (up (min 4 (1- j)))
|
|
458 (down (min 4 (- lm-board-height j))))
|
|
459 (+ -12
|
|
460 (min (max (+ left right) 3) 8)
|
|
461 (min (max (+ up down) 3) 8)
|
|
462 (min (max (+ (min left up) (min right down)) 3) 8)
|
|
463 (min (max (+ (min right up) (min left down)) 3) 8))))
|
|
464
|
|
465 (defun lm-init-square-score (i j)
|
|
466 "Give initial score to square I,J and to its mirror images."
|
|
467 (let ((ii (1+ (- lm-board-width i)))
|
|
468 (jj (1+ (- lm-board-height j)))
|
|
469 (sc (* (lm-nb-qtuples i j) (aref lm-score-trans-table 0))))
|
|
470 (aset lm-score-table (lm-xy-to-index i j) sc)
|
|
471 (aset lm-score-table (lm-xy-to-index ii j) sc)
|
|
472 (aset lm-score-table (lm-xy-to-index i jj) sc)
|
|
473 (aset lm-score-table (lm-xy-to-index ii jj) sc)))
|
|
474 ;;;_ - MAINTAINING THE SCORE TABLE.
|
|
475
|
|
476
|
|
477 ;; We do not provide functions for computing the SCORE-TABLE given the
|
|
478 ;; contents of the BOARD. This would involve heavy nested loops, with time
|
|
479 ;; proportional to the size of the board. It is better to update the
|
|
480 ;; SCORE-TABLE after each move. Updating needs not modify more than 36
|
|
481 ;; squares: it is done in constant time.
|
|
482
|
|
483 (defun lm-update-score-table (square dval)
|
|
484 "Update score table after SQUARE received a DVAL increment."
|
|
485 ;; The board has already been updated when this function is called.
|
|
486 ;; Updating scores is done by looking for qtuples boundaries in all four
|
|
487 ;; directions and then calling update-score-in-direction.
|
|
488 ;; Finally all squares received the right increment, and then are up to
|
|
489 ;; date, except possibly for SQUARE itself if we are taking a move back for
|
|
490 ;; its score had been set to -1 at the time.
|
|
491 (let* ((x (lm-index-to-x square))
|
|
492 (y (lm-index-to-y square))
|
|
493 (imin (max -4 (- 1 x)))
|
|
494 (jmin (max -4 (- 1 y)))
|
|
495 (imax (min 0 (- lm-board-width x 4)))
|
|
496 (jmax (min 0 (- lm-board-height y 4))))
|
|
497 (lm-update-score-in-direction imin imax
|
|
498 square 1 0 dval)
|
|
499 (lm-update-score-in-direction jmin jmax
|
|
500 square 0 1 dval)
|
|
501 (lm-update-score-in-direction (max imin jmin) (min imax jmax)
|
|
502 square 1 1 dval)
|
|
503 (lm-update-score-in-direction (max (- 1 y) -4
|
|
504 (- x lm-board-width))
|
|
505 (min 0 (- x 5)
|
|
506 (- lm-board-height y 4))
|
|
507 square -1 1 dval)))
|
|
508
|
|
509 (defun lm-update-score-in-direction (left right square dx dy dval)
|
|
510 "Update scores for all squares in the qtuples starting between the LEFTth
|
|
511 square and the RIGHTth after SQUARE, along the DX, DY direction, considering
|
|
512 that DVAL has been added on SQUARE."
|
|
513 ;; We always have LEFT <= 0, RIGHT <= 0 and DEPL > 0 but we may very well
|
|
514 ;; have LEFT > RIGHT, indicating that no qtuple contains SQUARE along that
|
|
515 ;; DX,DY direction.
|
|
516 (cond
|
|
517 ((> left right)) ; Quit
|
|
518 (t ; Else ..
|
|
519 (let (depl square0 square1 square2 count delta)
|
|
520 (setq depl (lm-xy-to-index dx dy)
|
|
521 square0 (+ square (* left depl))
|
|
522 square1 (+ square (* right depl))
|
|
523 square2 (+ square0 (* 4 depl)))
|
|
524 ;; Compute the contents of the first qtuple:
|
|
525 (setq square square0
|
|
526 count 0)
|
|
527 (while (<= square square2)
|
|
528 (setq count (+ count (aref lm-board square))
|
|
529 square (+ square depl)))
|
|
530 (while (<= square0 square1)
|
|
531 ;; Update the squares of the qtuple beginning in SQUARE0 and ending
|
|
532 ;; in SQUARE2.
|
|
533 (setq delta (- (aref lm-score-trans-table count)
|
|
534 (aref lm-score-trans-table (- count dval))))
|
|
535 (cond ((not (zerop delta)) ; or else nothing to update
|
|
536 (setq square square0)
|
|
537 (while (<= square square2)
|
|
538 (if (zerop (aref lm-board square)) ; only for free squares
|
|
539 (aset lm-score-table square
|
|
540 (+ (aref lm-score-table square) delta)))
|
|
541 (setq square (+ square depl)))))
|
|
542 ;; Then shift the qtuple one square along DEPL, this only requires
|
|
543 ;; modifying SQUARE0 and SQUARE2.
|
|
544 (setq square2 (+ square2 depl)
|
|
545 count (+ count (- (aref lm-board square0))
|
|
546 (aref lm-board square2))
|
|
547 square0 (+ square0 depl)))))))
|
|
548
|
|
549 ;;;
|
|
550 ;;; GAME CONTROL.
|
|
551 ;;;
|
|
552
|
|
553 ;; Several variables are used to monitor a game, including a GAME-HISTORY (the
|
|
554 ;; list of all (SQUARE . PREVSCORE) played) that allows to take moves back
|
|
555 ;; (anti-updating the score table) and to compute the table from scratch in
|
|
556 ;; case of an interruption.
|
|
557
|
|
558 (defvar lm-game-in-progress nil
|
|
559 "Non-nil if a game is in progress.")
|
|
560
|
|
561 (defvar lm-game-history nil
|
|
562 "A record of all moves that have been played during current game.")
|
|
563
|
|
564 (defvar lm-number-of-moves nil
|
|
565 "Number of moves already played in current game.")
|
|
566
|
|
567 (defvar lm-number-of-human-moves nil
|
|
568 "Number of moves already played by human in current game.")
|
|
569
|
|
570 (defvar lm-emacs-played-first nil
|
|
571 "Non-nil if Emacs played first.")
|
|
572
|
|
573 (defvar lm-human-took-back nil
|
|
574 "Non-nil if Human took back a move during the game.")
|
|
575
|
|
576 (defvar lm-human-refused-draw nil
|
|
577 "Non-nil if Human refused Emacs offer of a draw.")
|
|
578
|
|
579 (defvar lm-emacs-is-computing nil
|
|
580 ;; This is used to detect interruptions. Hopefully, it should not be needed.
|
|
581 "Non-nil if Emacs is in the middle of a computation.")
|
|
582
|
|
583
|
|
584 (defun lm-start-game (n m)
|
|
585 "Initialize a new game on an N by M board."
|
|
586 (setq lm-emacs-is-computing t) ; Raise flag
|
|
587 (setq lm-game-in-progress t)
|
|
588 (setq lm-board-width n
|
|
589 lm-board-height m
|
|
590 lm-vector-length (1+ (* (+ m 2) (1+ n)))
|
|
591 lm-draw-limit (/ (* 7 n m) 10))
|
|
592 (setq lm-emacs-won nil
|
|
593 lm-game-history nil
|
|
594 lm-number-of-moves 0
|
|
595 lm-number-of-human-moves 0
|
|
596 lm-emacs-played-first nil
|
|
597 lm-human-took-back nil
|
|
598 lm-human-refused-draw nil)
|
|
599 (lm-init-display n m) ; Display first: the rest takes time
|
|
600 (lm-init-score-table) ; INIT-BOARD requires that the score
|
|
601 (lm-init-board) ; table be already created.
|
|
602 (setq lm-emacs-is-computing nil))
|
|
603
|
|
604 (defun lm-play-move (square val &optional dont-update-score)
|
|
605 "Go to SQUARE, play VAL and update everything."
|
|
606 (setq lm-emacs-is-computing t) ; Raise flag
|
|
607 (cond ((= 1 val) ; a Human move
|
|
608 (setq lm-number-of-human-moves (1+ lm-number-of-human-moves)))
|
|
609 ((zerop lm-number-of-moves) ; an Emacs move. Is it first ?
|
|
610 (setq lm-emacs-played-first t)))
|
|
611 (setq lm-game-history
|
|
612 (cons (cons square (aref lm-score-table square))
|
|
613 lm-game-history)
|
|
614 lm-number-of-moves (1+ lm-number-of-moves))
|
|
615 (lm-plot-square square val)
|
|
616 (aset lm-board square val) ; *BEFORE* UPDATE-SCORE !
|
|
617 (if dont-update-score nil
|
|
618 (lm-update-score-table square val) ; previous val was 0: dval = val
|
|
619 (aset lm-score-table square -1))
|
|
620 (setq lm-emacs-is-computing nil))
|
|
621
|
|
622 (defun lm-take-back ()
|
|
623 "Take back last move and update everything."
|
|
624 (setq lm-emacs-is-computing t)
|
|
625 (let* ((last-move (car lm-game-history))
|
|
626 (square (car last-move))
|
|
627 (oldval (aref lm-board square)))
|
|
628 (if (= 1 oldval)
|
|
629 (setq lm-number-of-human-moves (1- lm-number-of-human-moves)))
|
|
630 (setq lm-game-history (cdr lm-game-history)
|
|
631 lm-number-of-moves (1- lm-number-of-moves))
|
|
632 (lm-plot-square square 0)
|
|
633 (aset lm-board square 0) ; *BEFORE* UPDATE-SCORE !
|
|
634 (lm-update-score-table square (- oldval))
|
|
635 (aset lm-score-table square (cdr last-move)))
|
|
636 (setq lm-emacs-is-computing nil))
|
|
637
|
|
638
|
|
639
|
|
640 ;;;_ + SESSION CONTROL.
|
|
641
|
|
642
|
|
643 (defvar lm-number-of-emacs-wins 0
|
|
644 "Number of games Emacs won in this session.")
|
|
645
|
|
646 (defvar lm-number-of-human-wins 0
|
|
647 "Number of games you won in this session.")
|
|
648
|
|
649 (defvar lm-number-of-draws 0
|
|
650 "Number of games already drawn in this session.")
|
|
651
|
|
652
|
|
653 (defun lm-terminate-game (result)
|
|
654 "Terminate the current game with RESULT."
|
|
655 (message
|
|
656 (cond
|
|
657 ((eq result 'emacs-won)
|
|
658 (setq lm-number-of-emacs-wins (1+ lm-number-of-emacs-wins))
|
|
659 (cond ((< lm-number-of-moves 20)
|
|
660 "This was a REALLY QUICK win.")
|
|
661 (lm-human-refused-draw
|
|
662 "I won... Too bad you refused my offer of a draw !")
|
|
663 (lm-human-took-back
|
|
664 "I won... Taking moves back will not help you !")
|
|
665 ((not lm-emacs-played-first)
|
|
666 "I won... Playing first did not help you much !")
|
|
667 ((and (zerop lm-number-of-human-wins)
|
|
668 (zerop lm-number-of-draws)
|
|
669 (> lm-number-of-emacs-wins 1))
|
|
670 "I'm becoming tired of winning...")
|
|
671 ("I won.")))
|
|
672 ((eq result 'human-won)
|
|
673 (setq lm-number-of-human-wins (1+ lm-number-of-human-wins))
|
|
674 (concat "OK, you won this one."
|
|
675 (cond
|
|
676 (lm-human-took-back
|
|
677 " I, for one, never take my moves back...")
|
|
678 (lm-emacs-played-first
|
|
679 ".. so what ?")
|
|
680 (" Now, let me play first just once."))))
|
|
681 ((eq result 'human-resigned)
|
|
682 (setq lm-number-of-emacs-wins (1+ lm-number-of-emacs-wins))
|
|
683 "So you resign. That's just one more win for me.")
|
|
684 ((eq result 'nobody-won)
|
|
685 (setq lm-number-of-draws (1+ lm-number-of-draws))
|
|
686 (concat "This is a draw. "
|
|
687 (cond
|
|
688 (lm-human-took-back
|
|
689 "I, for one, never take my moves back...")
|
|
690 (lm-emacs-played-first
|
|
691 "Just chance, I guess.")
|
|
692 ("Now, let me play first just once."))))
|
|
693 ((eq result 'draw-agreed)
|
|
694 (setq lm-number-of-draws (1+ lm-number-of-draws))
|
|
695 (concat "Draw agreed. "
|
|
696 (cond
|
|
697 (lm-human-took-back
|
|
698 "I, for one, never take my moves back...")
|
|
699 (lm-emacs-played-first
|
|
700 "You were lucky.")
|
|
701 ("Now, let me play first just once."))))
|
|
702 ((eq result 'crash-game)
|
|
703 "Sorry, I have been interrupted and cannot resume that game...")))
|
|
704 (lm-display-statistics)
|
|
705 ;;(ding)
|
|
706 (setq lm-game-in-progress nil))
|
|
707
|
|
708 (defun lm-crash-game ()
|
|
709 "What to do when Emacs detects it has been interrupted."
|
|
710 (setq lm-emacs-is-computing nil)
|
|
711 (lm-terminate-game 'crash-game)
|
|
712 (sit-for 4) ; Let's see the message
|
|
713 (lm-prompt-for-other-game))
|
|
714
|
|
715
|
|
716
|
|
717
|
|
718
|
|
719 ;;;_ + INTERACTIVE COMMANDS.
|
|
720
|
|
721
|
|
722
|
|
723 (defun lm-emacs-plays ()
|
|
724 "Compute Emacs next move and play it."
|
|
725 (interactive)
|
|
726 (lm-switch-to-window)
|
|
727 (cond
|
|
728 (lm-emacs-is-computing
|
|
729 (lm-crash-game))
|
|
730 ((not lm-game-in-progress)
|
|
731 (lm-prompt-for-other-game))
|
|
732 (t
|
|
733 (message "Let me think...")
|
|
734 (let (square score)
|
|
735 (setq square (lm-strongest-square))
|
|
736 (cond ((null square)
|
|
737 (lm-terminate-game 'nobody-won))
|
|
738 (t
|
|
739 (setq score (aref lm-score-table square))
|
|
740 (lm-play-move square 6)
|
|
741 (cond ((>= score lm-winning-threshold)
|
|
742 (setq lm-emacs-won t) ; for font-lock
|
|
743 (lm-find-filled-qtuple square 6)
|
|
744 (lm-terminate-game 'emacs-won))
|
|
745 ((zerop score)
|
|
746 (lm-terminate-game 'nobody-won))
|
|
747 ((and (> lm-number-of-moves lm-draw-limit)
|
|
748 (not lm-human-refused-draw)
|
|
749 (lm-offer-a-draw))
|
|
750 (lm-terminate-game 'draw-agreed))
|
|
751 (t
|
|
752 (lm-prompt-for-move)))))))))
|
|
753
|
|
754 ;; For small square dimensions this is approximate, since though measured in
|
|
755 ;; pixels, event's (X . Y) is a character's top-left corner.
|
|
756 (defun lm-click (click)
|
|
757 "Position at the square where you click."
|
|
758 (interactive "e")
|
|
759 (and (windowp (posn-window (setq click (event-end click))))
|
|
760 (numberp (posn-point click))
|
|
761 (select-window (posn-window click))
|
|
762 (setq click (posn-col-row click))
|
|
763 (lm-goto-xy
|
|
764 (min (max (/ (+ (- (car click)
|
|
765 lm-x-offset
|
|
766 1)
|
|
767 (window-hscroll)
|
|
768 lm-square-width
|
|
769 (% lm-square-width 2)
|
|
770 (/ lm-square-width 2))
|
|
771 lm-square-width)
|
|
772 1)
|
|
773 lm-board-width)
|
|
774 (min (max (/ (+ (- (cdr click)
|
|
775 lm-y-offset
|
|
776 1)
|
|
777 (let ((inhibit-point-motion-hooks t))
|
|
778 (count-lines 1 (window-start)))
|
|
779 lm-square-height
|
|
780 (% lm-square-height 2)
|
|
781 (/ lm-square-height 2))
|
|
782 lm-square-height)
|
|
783 1)
|
|
784 lm-board-height))))
|
|
785
|
|
786 (defun lm-mouse-play (click)
|
|
787 "Play at the square where you click."
|
|
788 (interactive "e")
|
|
789 (if (lm-click click)
|
|
790 (lm-human-plays)))
|
|
791
|
|
792 (defun lm-human-plays ()
|
|
793 "Signal to the Lm program that you have played.
|
|
794 You must have put the cursor on the square where you want to play.
|
|
795 If the game is finished, this command requests for another game."
|
|
796 (interactive)
|
|
797 (lm-switch-to-window)
|
|
798 (cond
|
|
799 (lm-emacs-is-computing
|
|
800 (lm-crash-game))
|
|
801 ((not lm-game-in-progress)
|
|
802 (lm-prompt-for-other-game))
|
|
803 (t
|
|
804 (let (square score)
|
|
805 (setq square (lm-point-square))
|
|
806 (cond ((null square)
|
|
807 (error "Your point is not on a square. Retry !"))
|
|
808 ((not (zerop (aref lm-board square)))
|
|
809 (error "Your point is not on a free square. Retry !"))
|
|
810 (t
|
|
811 (setq score (aref lm-score-table square))
|
|
812 (lm-play-move square 1)
|
|
813 (cond ((and (>= score lm-loosing-threshold)
|
|
814 ;; Just testing SCORE > THRESHOLD is not enough for
|
|
815 ;; detecting wins, it just gives an indication that
|
|
816 ;; we confirm with LM-FIND-FILLED-QTUPLE.
|
|
817 (lm-find-filled-qtuple square 1))
|
|
818 (lm-terminate-game 'human-won))
|
|
819 (t
|
|
820 (lm-emacs-plays)))))))))
|
|
821
|
|
822 (defun lm-human-takes-back ()
|
|
823 "Signal to the Lm program that you wish to take back your last move."
|
|
824 (interactive)
|
|
825 (lm-switch-to-window)
|
|
826 (cond
|
|
827 (lm-emacs-is-computing
|
|
828 (lm-crash-game))
|
|
829 ((not lm-game-in-progress)
|
|
830 (message "Too late for taking back...")
|
|
831 (sit-for 4)
|
|
832 (lm-prompt-for-other-game))
|
|
833 ((zerop lm-number-of-human-moves)
|
|
834 (message "You have not played yet... Your move ?"))
|
|
835 (t
|
|
836 (message "One moment, please...")
|
|
837 ;; It is possible for the user to let Emacs play several consecutive
|
|
838 ;; moves, so that the best way to know when to stop taking back moves is
|
|
839 ;; to count the number of human moves:
|
|
840 (setq lm-human-took-back t)
|
|
841 (let ((number lm-number-of-human-moves))
|
|
842 (while (= number lm-number-of-human-moves)
|
|
843 (lm-take-back)))
|
|
844 (lm-prompt-for-move))))
|
|
845
|
|
846 (defun lm-human-resigns ()
|
|
847 "Signal to the Lm program that you may want to resign."
|
|
848 (interactive)
|
|
849 (lm-switch-to-window)
|
|
850 (cond
|
|
851 (lm-emacs-is-computing
|
|
852 (lm-crash-game))
|
|
853 ((not lm-game-in-progress)
|
|
854 (message "There is no game in progress"))
|
|
855 ((y-or-n-p "You mean, you resign ")
|
|
856 (lm-terminate-game 'human-resigned))
|
|
857 ((y-or-n-p "You mean, we continue ")
|
|
858 (lm-prompt-for-move))
|
|
859 (t
|
|
860 (lm-terminate-game 'human-resigned)))) ; OK. Accept it
|
|
861
|
|
862
|
|
863
|
|
864 ;;;_ + PROMPTING THE HUMAN PLAYER.
|
|
865
|
|
866 (defun lm-prompt-for-move ()
|
|
867 "Display a message asking for Human's move."
|
|
868 (message (if (zerop lm-number-of-human-moves)
|
|
869 "Your move ? (move to a free square and hit X, RET ...)"
|
|
870 "Your move ?"))
|
|
871 ;; This may seem silly, but if one omits the following line (or a similar
|
|
872 ;; one), the cursor may very well go to some place where POINT is not.
|
|
873 (save-excursion (set-buffer (other-buffer))))
|
|
874
|
|
875 (defun lm-prompt-for-other-game ()
|
|
876 "Ask for another game, and start it."
|
|
877 (if (y-or-n-p "Another game ")
|
|
878 (lm lm-board-width lm-board-height)
|
|
879 (message "Chicken !")))
|
|
880
|
|
881 (defun lm-offer-a-draw ()
|
|
882 "Offer a draw and return T if Human accepted it."
|
|
883 (or (y-or-n-p "I offer you a draw. Do you accept it ")
|
|
884 (not (setq lm-human-refused-draw t))))
|
|
885
|
|
886
|
|
887
|
|
888 ;;;_ + DISPLAYING THE BOARD.
|
|
889
|
|
890 ;; You may change these values if you have a small screen or if the squares
|
|
891 ;; look rectangular, but spacings SHOULD be at least 2 (MUST BE at least 1).
|
|
892
|
|
893 (defconst lm-square-width 2
|
|
894 "*Horizontal spacing between squares on the Lm board.")
|
|
895
|
|
896 (defconst lm-square-height 1
|
|
897 "*Vertical spacing between squares on the Lm board.")
|
|
898
|
|
899 (defconst lm-x-offset 3
|
|
900 "*Number of columns between the Lm board and the side of the window.")
|
|
901
|
|
902 (defconst lm-y-offset 1
|
|
903 "*Number of lines between the Lm board and the top of the window.")
|
|
904
|
|
905
|
|
906 (defun lm-max-width ()
|
|
907 "Largest possible board width for the current window."
|
|
908 (1+ (/ (- (window-width (selected-window))
|
|
909 lm-x-offset lm-x-offset 1)
|
|
910 lm-square-width)))
|
|
911
|
|
912 (defun lm-max-height ()
|
|
913 "Largest possible board height for the current window."
|
|
914 (1+ (/ (- (window-height (selected-window))
|
|
915 lm-y-offset lm-y-offset 2)
|
|
916 ;; 2 instead of 1 because WINDOW-HEIGHT includes the mode line !
|
|
917 lm-square-height)))
|
|
918
|
|
919 (defun lm-point-y ()
|
|
920 "Return the board row where point is."
|
|
921 (let ((inhibit-point-motion-hooks t))
|
|
922 (1+ (/ (- (count-lines 1 (point)) lm-y-offset (if (bolp) 0 1))
|
|
923 lm-square-height))))
|
|
924 (defun my-lm-point-y ()
|
|
925 (interactive)
|
|
926 "Return the board row where point is."
|
|
927 (let ((inhibit-point-motion-hooks t))
|
|
928 (message (format "%S"
|
|
929 (1+ (/ (- (count-lines 1 (point)) lm-y-offset (if (bolp) 0 1))
|
|
930 lm-square-height))))))
|
|
931
|
|
932 (defun lm-point-square ()
|
|
933 "Return the index of the square point is on."
|
|
934 (let ((inhibit-point-motion-hooks t))
|
|
935 (lm-xy-to-index (1+ (/ (- (current-column) lm-x-offset)
|
|
936 lm-square-width))
|
|
937 (lm-point-y))))
|
|
938
|
|
939 (defun lm-goto-square (index)
|
|
940 "Move point to square number INDEX."
|
|
941 (lm-goto-xy (lm-index-to-x index) (lm-index-to-y index)))
|
|
942
|
|
943 (defun lm-goto-xy (x y)
|
|
944 "Move point to square at X, Y coords."
|
|
945 (let ((inhibit-point-motion-hooks t))
|
|
946 (goto-line (+ 1 lm-y-offset (* lm-square-height (1- y)))))
|
|
947 (move-to-column (+ lm-x-offset (* lm-square-width (1- x)))))
|
|
948
|
|
949 (defun lm-plot-square (square value)
|
|
950 "Draw 'X', 'O' or '.' on SQUARE depending on VALUE, leave point there."
|
|
951 (or (= value 1)
|
|
952 (lm-goto-square square))
|
|
953 (let ((inhibit-read-only t)
|
|
954 (inhibit-point-motion-hooks t))
|
|
955 (insert-and-inherit (cond ((= value 1) ?.)
|
|
956 ((= value 2) ?N)
|
|
957 ((= value 3) ?S)
|
|
958 ((= value 4) ?E)
|
|
959 ((= value 5) ?W)
|
|
960 ((= value 6) ?^)))
|
|
961
|
|
962 (and window-system
|
|
963 (zerop value)
|
|
964 (put-text-property (1- (point)) (point) 'mouse-face 'highlight))
|
|
965 (delete-char 1)
|
|
966 (backward-char 1))
|
|
967 (sit-for 0)) ; Display NOW
|
|
968
|
|
969 (defun lm-init-display (n m)
|
|
970 "Display an N by M Lm board."
|
|
971 (buffer-disable-undo (current-buffer))
|
|
972 (let ((inhibit-read-only t)
|
|
973 (point 1) opoint
|
|
974 (intangible t)
|
|
975 (i m) j x)
|
|
976 ;; Try to minimize number of chars (because of text properties)
|
|
977 (setq tab-width
|
|
978 (if (zerop (% lm-x-offset lm-square-width))
|
|
979 lm-square-width
|
|
980 (max (/ (+ (% lm-x-offset lm-square-width)
|
|
981 lm-square-width 1) 2) 2)))
|
|
982 (erase-buffer)
|
|
983 (newline lm-y-offset)
|
|
984 (while (progn
|
|
985 (setq j n
|
|
986 x (- lm-x-offset lm-square-width))
|
|
987 (while (>= (setq j (1- j)) 0)
|
|
988 (insert-char ?\t (/ (- (setq x (+ x lm-square-width))
|
|
989 (current-column))
|
|
990 tab-width))
|
|
991 (insert-char ? (- x (current-column)))
|
|
992 (if (setq intangible (not intangible))
|
|
993 (put-text-property point (point) 'intangible 2))
|
|
994 (and (zerop j)
|
|
995 (= i (- m 2))
|
|
996 (progn
|
|
997 (while (>= i 3)
|
|
998 (append-to-buffer (current-buffer) opoint (point))
|
|
999 (setq i (- i 2)))
|
|
1000 (goto-char (point-max))))
|
|
1001 (setq point (point))
|
|
1002 (insert ?=)
|
|
1003 (if window-system
|
|
1004 (put-text-property point (point)
|
|
1005 'mouse-face 'highlight)))
|
|
1006 (> (setq i (1- i)) 0))
|
|
1007 (if (= i (1- m))
|
|
1008 (setq opoint point))
|
|
1009 (insert-char ?\n lm-square-height))
|
|
1010 (or (eq (char-after 1) ?.)
|
|
1011 (put-text-property 1 2 'point-entered
|
|
1012 (lambda (x x) (if (bobp) (forward-char)))))
|
|
1013 (or intangible
|
|
1014 (put-text-property point (point) 'intangible 2))
|
|
1015 (put-text-property point (point) 'point-entered
|
|
1016 (lambda (x x) (if (eobp) (backward-char))))
|
|
1017 (put-text-property (point-min) (point) 'category 'lm-mode))
|
|
1018 (lm-goto-xy (/ (1+ n) 2) (/ (1+ m) 2)) ; center of the board
|
|
1019 (sit-for 0)) ; Display NOW
|
|
1020
|
|
1021 (defun lm-display-statistics ()
|
|
1022 "Obnoxiously display some statistics about previous games in mode line."
|
|
1023 ;; We store this string in the mode-line-process local variable.
|
|
1024 ;; This is certainly not the cleanest way out ...
|
|
1025 (setq mode-line-process
|
|
1026 (format ": Won %d, lost %d%s"
|
|
1027 lm-number-of-human-wins
|
|
1028 lm-number-of-emacs-wins
|
|
1029 (if (zerop lm-number-of-draws)
|
|
1030 ""
|
|
1031 (format ", drew %d" lm-number-of-draws))))
|
|
1032 (force-mode-line-update))
|
|
1033
|
|
1034 (defun lm-switch-to-window ()
|
|
1035 "Find or create the Lm buffer, and display it."
|
|
1036 (interactive)
|
|
1037 (let ((buff (get-buffer "*Lm*")))
|
|
1038 (if buff ; Buffer exists:
|
|
1039 (switch-to-buffer buff) ; no problem.
|
|
1040 (if lm-game-in-progress
|
|
1041 (lm-crash-game)) ; buffer has been killed or something
|
|
1042 (switch-to-buffer "*Lm*") ; Anyway, start anew.
|
|
1043 (lm-mode))))
|
|
1044
|
|
1045
|
|
1046
|
|
1047 ;;;_ + CROSSING WINNING QTUPLES.
|
|
1048
|
|
1049 ;; When someone succeeds in filling a qtuple, we draw a line over the five
|
|
1050 ;; corresponding squares. One problem is that the program does not know which
|
|
1051 ;; squares ! It only knows the square where the last move has been played and
|
|
1052 ;; who won. The solution is to scan the board along all four directions.
|
|
1053
|
|
1054 (defun lm-find-filled-qtuple (square value)
|
|
1055 "Return T if SQUARE belongs to a qtuple filled with VALUEs."
|
|
1056 (or (lm-check-filled-qtuple square value 1 0)
|
|
1057 (lm-check-filled-qtuple square value 0 1)
|
|
1058 (lm-check-filled-qtuple square value 1 1)
|
|
1059 (lm-check-filled-qtuple square value -1 1)))
|
|
1060
|
|
1061 (defun lm-check-filled-qtuple (square value dx dy)
|
|
1062 "Return T if SQUARE belongs to a qtuple filled with VALUEs along DX, DY."
|
|
1063 (let ((a 0) (b 0)
|
|
1064 (left square) (right square)
|
|
1065 (depl (lm-xy-to-index dx dy)))
|
|
1066 (while (and (> a -4) ; stretch tuple left
|
|
1067 (= value (aref lm-board (setq left (- left depl)))))
|
|
1068 (setq a (1- a)))
|
|
1069 (while (and (< b (+ a 4)) ; stretch tuple right
|
|
1070 (= value (aref lm-board (setq right (+ right depl)))))
|
|
1071 (setq b (1+ b)))
|
|
1072 (cond ((= b (+ a 4)) ; tuple length = 5 ?
|
|
1073 (lm-cross-qtuple (+ square (* a depl)) (+ square (* b depl))
|
|
1074 dx dy)
|
|
1075 t))))
|
|
1076
|
|
1077 (defun lm-cross-qtuple (square1 square2 dx dy)
|
|
1078 "Cross every square between SQUARE1 and SQUARE2 in the DX, DY direction."
|
|
1079 (save-excursion ; Not moving point from last square
|
|
1080 (let ((depl (lm-xy-to-index dx dy))
|
|
1081 (inhibit-read-only t)
|
|
1082 (inhibit-point-motion-hooks t))
|
|
1083 ;; WARNING: this function assumes DEPL > 0 and SQUARE2 > SQUARE1
|
|
1084 (while (/= square1 square2)
|
|
1085 (lm-goto-square square1)
|
|
1086 (setq square1 (+ square1 depl))
|
|
1087 (cond
|
|
1088 ((= dy 0) ; Horizontal
|
|
1089 (forward-char 1)
|
|
1090 (insert-char ?- (1- lm-square-width) t)
|
|
1091 (delete-region (point) (progn
|
|
1092 (skip-chars-forward " \t")
|
|
1093 (point))))
|
|
1094 ((= dx 0) ; Vertical
|
|
1095 (let ((n 1)
|
|
1096 (column (current-column)))
|
|
1097 (while (< n lm-square-height)
|
|
1098 (setq n (1+ n))
|
|
1099 (forward-line 1)
|
|
1100 (indent-to column)
|
|
1101 (insert-and-inherit ?|))))
|
|
1102 ((= dx -1) ; 1st Diagonal
|
|
1103 (indent-to (prog1 (- (current-column) (/ lm-square-width 2))
|
|
1104 (forward-line (/ lm-square-height 2))))
|
|
1105 (insert-and-inherit ?/))
|
|
1106 (t ; 2nd Diagonal
|
|
1107 (indent-to (prog1 (+ (current-column) (/ lm-square-width 2))
|
|
1108 (forward-line (/ lm-square-height 2))))
|
|
1109 (insert-and-inherit ?\\))))))
|
|
1110 (sit-for 0)) ; Display NOW
|
|
1111
|
|
1112
|
|
1113
|
|
1114 ;;;_ + CURSOR MOTION.
|
|
1115
|
|
1116 ;; previous-line and next-line don't work right with intangible newlines
|
|
1117 (defun lm-move-down ()
|
|
1118 "Move point down one row on the Lm board."
|
|
1119 (interactive)
|
|
1120 (if (< (lm-point-y) lm-board-height)
|
|
1121 (next-line 1)));;; lm-square-height)))
|
|
1122
|
|
1123 (defun lm-move-up ()
|
|
1124 "Move point up one row on the Lm board."
|
|
1125 (interactive)
|
|
1126 (if (> (lm-point-y) 1)
|
|
1127 (previous-line lm-square-height)))
|
|
1128
|
|
1129 (defun lm-move-ne ()
|
|
1130 "Move point North East on the Lm board."
|
|
1131 (interactive)
|
|
1132 (lm-move-up)
|
|
1133 (forward-char))
|
|
1134
|
|
1135 (defun lm-move-se ()
|
|
1136 "Move point South East on the Lm board."
|
|
1137 (interactive)
|
|
1138 (lm-move-down)
|
|
1139 (forward-char))
|
|
1140
|
|
1141 (defun lm-move-nw ()
|
|
1142 "Move point North West on the Lm board."
|
|
1143 (interactive)
|
|
1144 (lm-move-up)
|
|
1145 (backward-char))
|
|
1146
|
|
1147 (defun lm-move-sw ()
|
|
1148 "Move point South West on the Lm board."
|
|
1149 (interactive)
|
|
1150 (lm-move-down)
|
|
1151 (backward-char))
|
|
1152
|
|
1153 (defun lm-beginning-of-line ()
|
|
1154 "Move point to first square on the Lm board row."
|
|
1155 (interactive)
|
|
1156 (move-to-column lm-x-offset))
|
|
1157
|
|
1158 (defun lm-end-of-line ()
|
|
1159 "Move point to last square on the Lm board row."
|
|
1160 (interactive)
|
|
1161 (move-to-column (+ lm-x-offset
|
|
1162 (* lm-square-width (1- lm-board-width)))))
|
|
1163
|
|
1164 (provide 'lm)
|
|
1165
|
|
1166
|
|
1167 (defun lm-xy-to-index (x y)
|
|
1168 "Translate X, Y cartesian coords into the corresponding board index."
|
|
1169 (+ (* y lm-board-width) x y))
|
|
1170
|
|
1171 (defun lm-index-to-x (index)
|
|
1172 "Return corresponding x-coord of board INDEX."
|
|
1173 (% index (1+ lm-board-width)))
|
|
1174
|
|
1175 (defun lm-index-to-y (index)
|
|
1176 "Return corresponding y-coord of board INDEX."
|
|
1177 (/ index (1+ lm-board-width)))
|
|
1178
|
|
1179
|
|
1180
|
|
1181
|
|
1182
|
|
1183
|
|
1184
|
|
1185
|
|
1186
|
|
1187 ;;;_* Terry's mods to create lm.el
|
|
1188
|
|
1189
|
|
1190
|
|
1191
|
|
1192
|
|
1193 ;;;_ + Debugging things
|
|
1194 (setq debug-on-error t)
|
|
1195 ;;;(setq lm-debug nil)
|
|
1196 (setq lm-debug t)
|
|
1197
|
|
1198 (defun lm-maybe-debug ()
|
|
1199
|
|
1200 (if lm-debug
|
|
1201 (progn (lm-print-wts) (lm-blackbox) (lm-print-y,s,noise)
|
|
1202 (lm-print-smell))))
|
|
1203
|
|
1204 ;;;_ - Printing various things
|
|
1205 (defun lm-print-distance-int (direction)
|
|
1206 (interactive)
|
|
1207 (insert (format "%S %S " direction (get direction 'distance))))
|
|
1208
|
|
1209
|
|
1210 (defun lm-print-distance ()
|
|
1211 (insert (format "tree: %S \n" (calc-distance-of-robot-from 'lm-tree)))
|
|
1212 (mapc 'lm-print-distance-int lm-directions))
|
|
1213
|
|
1214
|
|
1215 ;;(setq direction 'lm-n)
|
|
1216 ;;(get 'lm-n 'lm-s)
|
|
1217 (defun lm-nslify-wts-int (direction)
|
|
1218 (mapcar '(lambda (target-direction)
|
|
1219 (get direction target-direction))
|
|
1220 lm-directions))
|
|
1221
|
|
1222
|
|
1223 (defun lm-nslify-wts ()
|
|
1224 (interactive)
|
|
1225 (let ((l (apply 'append (mapcar 'lm-nslify-wts-int lm-directions))))
|
|
1226 (insert (format "set data_value WTS \n %s \n" l))
|
|
1227 (insert (format "/* max: %S min: %S */"
|
|
1228 (eval (cons 'max l)) (eval (cons 'min l))))))
|
|
1229
|
|
1230 (defun lm-print-wts-int (direction)
|
|
1231 (mapc '(lambda (target-direction)
|
|
1232 (insert (format "%S %S %S "
|
|
1233 direction
|
|
1234 target-direction
|
|
1235 (get direction target-direction))))
|
|
1236 lm-directions)
|
|
1237 (insert "\n"))
|
|
1238
|
|
1239 (defun lm-print-wts ()
|
|
1240 (interactive)
|
|
1241 (save-excursion
|
|
1242 (set-buffer "*lm-wts*")
|
|
1243 (insert "==============================\n")
|
|
1244 (mapc 'lm-print-wts-int lm-directions)))
|
|
1245
|
|
1246 (defun lm-print-moves (moves)
|
|
1247 (interactive)
|
|
1248 (save-excursion
|
|
1249 (set-buffer "*lm-moves*")
|
|
1250 (insert (format "%S\n" moves))))
|
|
1251
|
|
1252
|
|
1253 (defun lm-print-y,s,noise-int (direction)
|
|
1254 (insert (format "%S:lm-y %S, s %S, noise %S \n"
|
|
1255 (symbol-name direction)
|
|
1256 (get direction 'y_t)
|
|
1257 (get direction 's)
|
|
1258 (get direction 'noise)
|
|
1259 )))
|
|
1260
|
|
1261 (defun lm-print-y,s,noise ()
|
|
1262 (interactive)
|
|
1263 (save-excursion
|
|
1264 (set-buffer "*lm-y,s,noise*")
|
|
1265 (insert "==============================\n")
|
|
1266 (mapc 'lm-print-y,s,noise-int lm-directions)))
|
|
1267
|
|
1268 (defun lm-print-smell-int (direction)
|
|
1269 (insert (format "%S: smell: %S \n"
|
|
1270 (symbol-name direction)
|
|
1271 (get direction 'smell))))
|
|
1272
|
|
1273 (defun lm-print-smell ()
|
|
1274 (interactive)
|
|
1275 (save-excursion
|
|
1276 (set-buffer "*lm-smell*")
|
|
1277 (insert "==============================\n")
|
|
1278 (insert (format "tree: %S \n" (get 'z 't)))
|
|
1279 (mapc 'lm-print-smell-int lm-directions)))
|
|
1280
|
|
1281 (defun lm-print-w0-int (direction)
|
|
1282 (insert (format "%S: w0: %S \n"
|
|
1283 (symbol-name direction)
|
|
1284 (get direction 'w0))))
|
|
1285
|
|
1286 (defun lm-print-w0 ()
|
|
1287 (interactive)
|
|
1288 (save-excursion
|
|
1289 (set-buffer "*lm-w0*")
|
|
1290 (insert "==============================\n")
|
|
1291 (mapc 'lm-print-w0-int lm-directions)))
|
|
1292
|
|
1293 (defun lm-blackbox ()
|
|
1294 (save-excursion
|
|
1295 (set-buffer "*lm-blackbox*")
|
|
1296 (insert "==============================\n")
|
|
1297 (insert "I smell: ")
|
|
1298 (mapc '(lambda (direction)
|
|
1299 (if (> (get direction 'smell) 0)
|
|
1300 (insert (format "%S " direction))))
|
|
1301 lm-directions)
|
|
1302 (insert "\n")
|
|
1303
|
|
1304 (insert "I move: ")
|
|
1305 (mapc '(lambda (direction)
|
|
1306 (if (> (get direction 'y_t) 0)
|
|
1307 (insert (format "%S " direction))))
|
|
1308 lm-directions)
|
|
1309 (insert "\n")
|
|
1310 (lm-print-wts-blackbox)
|
|
1311 (insert (format "z_t-z_t-1: %S" (- (get 'z 't) (get 'z 't-1))))
|
|
1312 (lm-print-distance)
|
|
1313 (insert "\n")))
|
|
1314
|
|
1315 (defun lm-print-wts-blackbox ()
|
|
1316 (interactive)
|
|
1317 (mapc 'lm-print-wts-int lm-directions))
|
|
1318
|
|
1319
|
|
1320
|
|
1321
|
|
1322
|
|
1323 ;;;_ + Simulation variables
|
|
1324
|
|
1325 ;;;_ - lm-nvar
|
|
1326 (defvar lm-nvar 0.0075 "affects a noise generator which was used in an
|
|
1327 earlier incarnation of this program to add a random element to the way
|
|
1328 moves were made. not used")
|
|
1329 ;;;_ - lists of cardinal directions
|
|
1330 ;;;_ :
|
|
1331 (defvar lm-ns '(lm-n lm-s) "used when doing something relative to the
|
|
1332 north and south axes")
|
|
1333 (defvar lm-ew '(lm-e lm-w) "used when doing something relative to the
|
|
1334 north and south axes")
|
|
1335 (defvar lm-directions '(lm-n lm-s lm-e lm-w) "the cardinal directions")
|
|
1336 (defvar lm-8-directions '(
|
|
1337 (lm-n) (lm-n lm-w) (lm-s)
|
|
1338 (lm-s lm-w) (lm-e) (lm-s lm-e)
|
|
1339 (lm-n lm-w) (lm-w))
|
|
1340 "the full 8 possible directions.")
|
|
1341 ;;;_ - learning parameters
|
|
1342 (defvar lm-bound 0.005 "the maximum that w0j may be.")
|
|
1343 (defvar lm-c 1.0 "a factor applied to modulate the increase in
|
|
1344 wij. used in the function lm-update-normal-weights")
|
|
1345 (defvar lm-c-naught 0.5 "a factor applied to modulate the increase in
|
|
1346 w0j. used in the function lm-update-naught-weights" )
|
|
1347 (defvar lm-initial-w0 0.0)
|
|
1348 (defvar lm-initial-wij 0.0)
|
|
1349 (defvar lm-no-payoff 0 "the amount of simulation cycles that have
|
|
1350 occurred with no movement. used to move the robot when he is stuck in
|
|
1351 a rut for some reason")
|
|
1352 (defvar lm-max-stall-time 3 "the maximum of amount of simulation
|
|
1353 cycles that the robot can get stuck in a place before lm-random-move
|
|
1354 is called to push him out of it")
|
|
1355
|
|
1356
|
|
1357
|
|
1358
|
|
1359
|
|
1360
|
|
1361
|
|
1362 ;;;_ + Randomizing functions
|
|
1363 ;;;_ - lm-flip-a-coin ()
|
|
1364 (defun lm-flip-a-coin ()
|
|
1365 (if (> (random 5000) 2500)
|
|
1366 -1
|
|
1367 1))
|
|
1368 ;;;_ : lm-very-small-random-number ()
|
|
1369 (defun lm-very-small-random-number ()
|
|
1370 (/
|
|
1371 (* (/ (random 900000) 900000.0) .0001)))
|
|
1372 ;;;_ : lm-randomize-weights-for (direction)
|
|
1373 (defun lm-randomize-weights-for (direction)
|
|
1374 (mapc '(lambda (target-direction)
|
|
1375 (put direction
|
|
1376 target-direction
|
|
1377 (* (lm-flip-a-coin) (/ (random 10000) 10000.0))))
|
|
1378 lm-directions))
|
|
1379 ;;;_ : lm-noise ()
|
|
1380 (defun lm-noise ()
|
|
1381 (* (- (/ (random 30001) 15000.0) 1) lm-nvar))
|
|
1382
|
|
1383 (defun lm-randomize-weights-for (direction)
|
|
1384 (mapc '(lambda (target-direction)
|
|
1385 (put direction
|
|
1386 target-direction
|
|
1387 (* (lm-flip-a-coin) (/ (random 10000) 10000.0))))
|
|
1388 lm-directions))
|
|
1389
|
|
1390
|
|
1391
|
|
1392
|
|
1393 ;;;_ : lm-fix-weights-for (direction)
|
|
1394 (defun lm-fix-weights-for (direction)
|
|
1395 (mapc '(lambda (target-direction)
|
|
1396 (put direction
|
|
1397 target-direction
|
|
1398 lm-initial-wij))
|
|
1399 lm-directions))
|
|
1400
|
|
1401
|
|
1402
|
|
1403
|
|
1404 ;;;_ + Plotting functions
|
|
1405 ;;;_ - lm-plot-internal (sym)
|
|
1406 (defun lm-plot-internal (sym)
|
|
1407 (lm-plot-square (lm-xy-to-index
|
|
1408 (get sym 'x)
|
|
1409 (get sym 'y))
|
|
1410 (get sym 'sym)))
|
|
1411 ;;;_ - lm-plot-landmarks ()
|
|
1412 (defun lm-plot-landmarks ()
|
|
1413 (setq lm-cx (/ lm-board-width 2))
|
|
1414 (setq lm-cy (/ lm-board-height 2))
|
|
1415
|
|
1416 (put 'lm-n 'x lm-cx)
|
|
1417 (put 'lm-n 'y 1)
|
|
1418 (put 'lm-n 'sym 2)
|
|
1419
|
|
1420 (put 'lm-tree 'x lm-cx)
|
|
1421 (put 'lm-tree 'y lm-cy)
|
|
1422 (put 'lm-tree 'sym 6)
|
|
1423
|
|
1424 (put 'lm-s 'x lm-cx)
|
|
1425 (put 'lm-s 'y lm-board-height)
|
|
1426 (put 'lm-s 'sym 3)
|
|
1427
|
|
1428 (put 'lm-w 'x 1)
|
|
1429 (put 'lm-w 'y (/ lm-board-height 2))
|
|
1430 (put 'lm-w 'sym 5)
|
|
1431
|
|
1432 (put 'lm-e 'x lm-board-width)
|
|
1433 (put 'lm-e 'y (/ lm-board-height 2))
|
|
1434 (put 'lm-e 'sym 4)
|
|
1435
|
|
1436 (mapc 'lm-plot-internal '(lm-n lm-s lm-e lm-w lm-tree)))
|
|
1437
|
|
1438
|
|
1439
|
|
1440 ;;;_ + Distance-calculation functions
|
|
1441 ;;;_ - square (a)
|
|
1442 (defun square (a)
|
|
1443 (* a a))
|
|
1444
|
|
1445 ;;;_ - distance (x x0 y y0)
|
|
1446 (defun distance (x x0 y y0)
|
|
1447 (sqrt (+ (square (- x x0)) (square (- y y0)))))
|
|
1448
|
|
1449 ;;;_ - calc-distance-of-robot-from (direction)
|
|
1450 (defun calc-distance-of-robot-from (direction)
|
|
1451 (put direction 'distance
|
|
1452 (distance (get direction 'x)
|
|
1453 (lm-index-to-x (lm-point-square))
|
|
1454 (get direction 'y)
|
|
1455 (lm-index-to-y (lm-point-square)))))
|
|
1456
|
|
1457 ;;;_ - calc-smell-internal (sym)
|
|
1458 (defun calc-smell-internal (sym)
|
|
1459 (let ((r (get sym 'r))
|
|
1460 (d (calc-distance-of-robot-from sym)))
|
|
1461 (if (> (* 0.5 (- 1 (/ d r))) 0)
|
|
1462 (* 0.5 (- 1 (/ d r)))
|
|
1463 0)))
|
|
1464
|
|
1465
|
|
1466
|
|
1467 ;;;_ + Learning (neural) functions
|
|
1468 (defun lm-f (x)
|
|
1469 (cond
|
|
1470 ((> x lm-bound) lm-bound)
|
|
1471 ((< x 0.0) 0.0)
|
|
1472 (t x)))
|
|
1473
|
|
1474 (defun lm-y (direction)
|
|
1475 (let ((noise (put direction 'noise (lm-noise))))
|
|
1476 (put direction 'y_t
|
|
1477 (if (> (get direction 's) 0.0)
|
|
1478 1.0
|
|
1479 0.0))))
|
|
1480
|
|
1481 (defun lm-update-normal-weights (direction)
|
|
1482 (mapc '(lambda (target-direction)
|
|
1483 (put direction target-direction
|
|
1484 (+
|
|
1485 (get direction target-direction)
|
|
1486 (* lm-c
|
|
1487 (- (get 'z 't) (get 'z 't-1))
|
|
1488 (get target-direction 'y_t)
|
|
1489 (get direction 'smell)))))
|
|
1490 lm-directions))
|
|
1491
|
|
1492 (defun lm-update-naught-weights (direction)
|
|
1493 (mapc '(lambda (target-direction)
|
|
1494 (put direction 'w0
|
|
1495 (lm-f
|
|
1496 (+
|
|
1497 (get direction 'w0)
|
|
1498 (* lm-c-naught
|
|
1499 (- (get 'z 't) (get 'z 't-1))
|
|
1500 (get direction 'y_t))))))
|
|
1501 lm-directions))
|
|
1502
|
|
1503
|
|
1504
|
|
1505 ;;;_ + Statistics gathering and creating functions
|
|
1506
|
|
1507 (defun lm-calc-current-smells ()
|
|
1508 (mapc '(lambda (direction)
|
|
1509 (put direction 'smell (calc-smell-internal direction)))
|
|
1510 lm-directions))
|
|
1511
|
|
1512 (defun lm-calc-payoff ()
|
|
1513 (put 'z 't-1 (get 'z 't))
|
|
1514 (put 'z 't (calc-smell-internal 'lm-tree))
|
|
1515 (if (= (- (get 'z 't) (get 'z 't-1)) 0.0)
|
|
1516 (incf lm-no-payoff)
|
|
1517 (setf lm-no-payoff 0)))
|
|
1518
|
|
1519 (defun lm-store-old-y_t ()
|
|
1520 (mapc '(lambda (direction)
|
|
1521 (put direction 'y_t-1 (get direction 'y_t)))
|
|
1522 lm-directions))
|
|
1523
|
|
1524
|
|
1525
|
|
1526 ;;;_ + Functions to move robot
|
|
1527
|
|
1528
|
|
1529 (defun lm-confidence-for (target-direction)
|
|
1530 (+
|
|
1531 (get target-direction 'w0)
|
|
1532 (reduce '+
|
|
1533 (mapcar '(lambda (direction)
|
|
1534 (*
|
|
1535 (get direction target-direction)
|
|
1536 (get direction 'smell))
|
|
1537 )
|
|
1538 lm-directions))))
|
|
1539
|
|
1540
|
|
1541 (defun lm-calc-confidences ()
|
|
1542 (mapc '(lambda (direction)
|
|
1543 (put direction 's (lm-confidence-for direction)))
|
|
1544 lm-directions))
|
|
1545
|
|
1546 (defun lm-move ()
|
|
1547 (if (and (= (get 'lm-n 'y_t) 1.0) (= (get 'lm-s 'y_t) 1.0))
|
|
1548 (progn
|
|
1549 (mapc '(lambda (dir) (put dir 'y_t 0)) lm-ns)
|
|
1550 (message "n-s normalization.")))
|
|
1551 (if (and (= (get 'lm-w 'y_t) 1.0) (= (get 'lm-e 'y_t) 1.0))
|
|
1552 (progn
|
|
1553 (mapc '(lambda (dir) (put dir 'y_t 0)) lm-ew)
|
|
1554 (message "e-w normalization")))
|
|
1555
|
|
1556 (mapc '(lambda (pair)
|
|
1557 (if (> (get (car pair) 'y_t) 0)
|
|
1558 (funcall (car (cdr pair)))))
|
|
1559 '(
|
|
1560 (lm-n lm-move-up)
|
|
1561 (lm-s lm-move-down)
|
|
1562 (lm-e forward-char)
|
|
1563 (lm-w backward-char)))
|
|
1564 (lm-plot-square (lm-point-square) 1)
|
|
1565 (incf lm-moves))
|
|
1566
|
|
1567
|
|
1568 (defun lm-random-move ()
|
|
1569 (mapc
|
|
1570 '(lambda (direction) (put direction 'y_t 0))
|
|
1571 lm-directions)
|
|
1572 (dolist (direction (nth (random 8) lm-8-directions))
|
|
1573 (put direction 'y_t 1.0))
|
|
1574 (lm-move))
|
|
1575
|
|
1576 (defun lm-amble-robot ()
|
|
1577 (interactive)
|
|
1578 (while (> (calc-distance-of-robot-from 'lm-tree) 0)
|
|
1579
|
|
1580 (lm-store-old-y_t)
|
|
1581 (lm-calc-current-smells)
|
|
1582
|
|
1583 (if (> lm-no-payoff lm-max-stall-time)
|
|
1584 (lm-random-move)
|
|
1585 (progn
|
|
1586 (lm-calc-confidences)
|
|
1587 (mapc 'lm-y lm-directions)
|
|
1588 (lm-move)))
|
|
1589
|
|
1590 (lm-calc-payoff)
|
|
1591
|
|
1592 (mapc 'lm-update-normal-weights lm-directions)
|
|
1593 (mapc 'lm-update-naught-weights lm-directions)
|
|
1594 (lm-maybe-debug))
|
|
1595
|
|
1596 (let ((lm-res-str (format "%S moves." lm-moves)))
|
|
1597 (if lm-debug
|
|
1598 (lm-print-moves lm-res-str))
|
|
1599 (message (format "%S moves." lm-moves))))
|
|
1600
|
|
1601 ;;;_ - lm-start-robot ()
|
|
1602 (defun lm-start-robot ()
|
|
1603 "Signal to the Lm program that you have played.
|
|
1604 You must have put the cursor on the square where you want to play.
|
|
1605 If the game is finished, this command requests for another game."
|
|
1606 (interactive)
|
|
1607 (lm-switch-to-window)
|
|
1608 (cond
|
|
1609 (lm-emacs-is-computing
|
|
1610 (lm-crash-game))
|
|
1611 ((not lm-game-in-progress)
|
|
1612 (lm-prompt-for-other-game))
|
|
1613 (t
|
|
1614 (let (square score)
|
|
1615 (setq square (lm-point-square))
|
|
1616 (cond ((null square)
|
|
1617 (error "Your point is not on a square. Retry !"))
|
|
1618 ((not (zerop (aref lm-board square)))
|
|
1619 (error "Your point is not on a free square. Retry !"))
|
|
1620 (t
|
|
1621 (progn
|
|
1622 (lm-plot-square square 1)
|
|
1623
|
|
1624 (lm-store-old-y_t)
|
|
1625 (lm-calc-current-smells)
|
|
1626 (put 'z 't (calc-smell-internal 'lm-tree))
|
|
1627
|
|
1628 (lm-random-move)
|
|
1629
|
|
1630 (lm-calc-payoff)
|
|
1631
|
|
1632 (mapc 'lm-update-normal-weights lm-directions)
|
|
1633 (mapc 'lm-update-naught-weights lm-directions)
|
|
1634 (lm-maybe-debug)
|
|
1635 (lm-amble-robot)
|
|
1636 )))))))
|
|
1637
|
|
1638
|
|
1639
|
|
1640 ;;;_ + Misc functions
|
|
1641 ;;;_ - lm-init (auto-start save-weights)
|
|
1642 (defun lm-init (auto-start save-weights)
|
|
1643
|
|
1644 (setq lm-moves 0)
|
|
1645
|
|
1646 (lm-plot-landmarks)
|
|
1647
|
|
1648 (if lm-debug
|
|
1649 (progn
|
|
1650 (save-excursion
|
|
1651 (set-buffer (get-buffer-create "*lm-w0*"))
|
|
1652 (erase-buffer)
|
|
1653 (set-buffer (get-buffer-create "*lm-moves*"))
|
|
1654 (set-buffer (get-buffer-create "*lm-wts*"))
|
|
1655 (erase-buffer)
|
|
1656 (set-buffer (get-buffer-create "*lm-y,s,noise*"))
|
|
1657 (erase-buffer)
|
|
1658 (set-buffer (get-buffer-create "*lm-smell*"))
|
|
1659 (erase-buffer)
|
|
1660 (set-buffer (get-buffer-create "*lm-blackbox*"))
|
|
1661 (erase-buffer)
|
|
1662 (set-buffer (get-buffer-create "*lm-distance*"))
|
|
1663 (erase-buffer))))
|
|
1664
|
|
1665
|
|
1666 (lm-set-landmark-signal-strengths)
|
|
1667
|
|
1668 (mapc '(lambda (direction)
|
|
1669 (put direction 'y_t 0.0))
|
|
1670 lm-directions)
|
|
1671
|
|
1672 (if (not save-weights)
|
|
1673 (progn
|
|
1674 (mapc 'lm-fix-weights-for lm-directions)
|
|
1675 (mapc '(lambda (direction)
|
|
1676 (put direction 'w0 lm-initial-w0))
|
|
1677 lm-directions))
|
|
1678 (message "Weights preserved for this run."))
|
|
1679
|
|
1680 (if auto-start
|
|
1681 (progn
|
|
1682 (lm-goto-xy (1+ (random lm-board-width)) (1+ (random lm-board-height)))
|
|
1683 (lm-start-robot))))
|
|
1684
|
|
1685
|
|
1686
|
|
1687 ;;;_ - something which doesn't work
|
|
1688 ; no-a-worka!!
|
|
1689 ;(defum lm-sum-list (list)
|
|
1690 ; (if (> (length list) 0)
|
|
1691 ; (+ (car list) (lm-sum-list (cdr list)))
|
|
1692 ; 0))
|
|
1693 ; this a worka!
|
|
1694 ; (eval (cons '+ list))
|
|
1695 ;;;_ - lm-set-landmark-signal-strengths ()
|
|
1696 ;;; on a screen higher than wide, I noticed that the robot would amble
|
|
1697 ;;; left and right and not move forward. examining *lm-blackbox*
|
|
1698 ;;; revealed that there was no scent from the north and south
|
|
1699 ;;; landmarks, hence, they need less factoring down of the effect of
|
|
1700 ;;; distance on scent.
|
|
1701
|
|
1702 (defun lm-set-landmark-signal-strengths ()
|
|
1703
|
|
1704 (setq lm-tree-r (* (sqrt (+ (square lm-cx) (square lm-cy))) 1.5))
|
|
1705
|
|
1706 (mapc '(lambda (direction)
|
|
1707 (put direction 'r (* lm-cx 1.1)))
|
|
1708 lm-ew)
|
|
1709 (mapc '(lambda (direction)
|
|
1710 (put direction 'r (* lm-cy 1.1)))
|
|
1711 lm-ns)
|
|
1712 (put 'lm-tree 'r lm-tree-r))
|
|
1713
|
|
1714
|
|
1715
|
|
1716
|
|
1717
|
|
1718 ;;;_ + lm-test-run ()
|
|
1719
|
|
1720 (defun lm-test-run ()
|
|
1721
|
|
1722 (interactive)
|
|
1723
|
|
1724 (lm 1)
|
|
1725
|
|
1726 (dotimes (scratch-var 100)
|
|
1727
|
|
1728 (lm 2)))
|
|
1729
|
|
1730
|
|
1731
|
|
1732 ;;;_ + lm: The function you invoke to play
|
|
1733
|
|
1734 ;;;###autoload
|
|
1735 (defun landmark (parg)
|
|
1736 "Start an Lm game.
|
|
1737 If a game is in progress, this command allows you to resume it.
|
|
1738 Here is the relation between prefix args and game options:
|
|
1739
|
|
1740 prefix arg | robot is auto-started | weights are saved from last game
|
|
1741 ---------------------------------------------------------------------
|
|
1742 none / 1 | yes | no
|
|
1743 2 | yes | yes
|
|
1744 3 | no | yes
|
|
1745 4 | no | no
|
|
1746
|
|
1747 You start by moving to a square and typing \\[lm-start-robot].
|
|
1748 Use \\[describe-mode] for more info."
|
|
1749 (interactive "p")
|
|
1750
|
|
1751 (setf n nil m nil)
|
|
1752 (lm-switch-to-window)
|
|
1753 (cond
|
|
1754 (lm-emacs-is-computing
|
|
1755 (lm-crash-game))
|
|
1756 ((or (not lm-game-in-progress)
|
|
1757 (<= lm-number-of-moves 2))
|
|
1758 (let ((max-width (lm-max-width))
|
|
1759 (max-height (lm-max-height)))
|
|
1760 (or n (setq n max-width))
|
|
1761 (or m (setq m max-height))
|
|
1762 (cond ((< n 1)
|
|
1763 (error "I need at least 1 column"))
|
|
1764 ((< m 1)
|
|
1765 (error "I need at least 1 row"))
|
|
1766 ((> n max-width)
|
|
1767 (error "I cannot display %d columns in that window" n)))
|
|
1768 (if (and (> m max-height)
|
|
1769 (not (eq m lm-saved-board-height))
|
|
1770 ;; Use EQ because SAVED-BOARD-HEIGHT may be nil
|
|
1771 (not (y-or-n-p (format "Do you really want %d rows " m))))
|
|
1772 (setq m max-height)))
|
|
1773 (message "One moment, please...")
|
|
1774 (lm-start-game n m)))
|
|
1775 (eval (cons 'lm-init
|
|
1776 (cond
|
|
1777 ((= parg 1) '(t nil))
|
|
1778 ((= parg 2) '(t t))
|
|
1779 ((= parg 3) '(nil t))
|
|
1780 ((= parg 4) '(nil nil))
|
|
1781 (t '(nil t))))))
|
|
1782
|
|
1783 ;;;_ + Local variables
|
|
1784
|
|
1785 ;;; The following `outline-layout' local variable setting:
|
|
1786 ;;; - closes all topics from the first topic to just before the third-to-last,
|
|
1787 ;;; - shows the children of the third to last (config vars)
|
|
1788 ;;; - and the second to last (code section),
|
|
1789 ;;; - and closes the last topic (this local-variables section).
|
|
1790 ;;;Local variables:
|
|
1791 ;;;outline-layout: (0 : -1 -1 0)
|
|
1792 ;;;End:
|
|
1793
|
|
1794
|
|
1795 ;;; landmark.el ends here
|