lisp

I have about two macros (and climbing) in my codebase that look like this: (defmacro def-stat-method (method-name stat) `(progn (defmethod ,method-name ((monster monster)) (getf (stats monster) ,stat)) (defmethod (setf ,method-name) (value (monster monster)) (setf (getf (stats monster) ,stat) value)))) and this: (defmacro def-energy-method (method-name stat) `(progn (defmethod ,method-name ((monster monster)) (getf (energies monster) ,stat)) (defmethod (setf ,method-name) (value (monster monster)) (setf (getf (energies monster) ,stat) value)))) Each of the macros has the following calling

I'm not very familiar with Clojure/Lisp macros. I would like to write apply-recur macro which would have same meaning as (apply recur ...) I guess there is no real need for such macro but I think it's a good exercise. So I'm asking for your solution. Well, there really is no need for that, if only because recur cannot take varargs (a recur to the top of the function takes a single final seqable argument grouping all arguments pass the last required argument). This doesn't affect the validity of the exercise, of course. However, there is a problem in that a "proper" apply-recur should

I have been doing object-oriented programming for a few years now, and I have not done much functional programming. I have an interest in flight simulators, and am curious about the functional programming aspect of Lisp. Flight simulators or any other real world simulator makes sense to me in an object-oriented paradigm. Here are my questions: Is object oriented the best way to represent a real world simulation domain? I know that Common Lisp has CLOS (OO for lisp), but my question is really about writing a flight simulator in a functional language. So if you were going to write it in Lisp,

I want to change the nth element of a list and return a new list. I've thought of three rather inelegant solutions: (defun set-nth1 (list n value) (let ((list2 (copy-seq list))) (setf (elt list2 n) value) list2)) (defun set-nth2 (list n value) (concatenate 'list (subseq list 0 n) (list value) (subseq list (1+ n)))) (defun set-nth3 (list n value) (substitute value nil list :test #'(lambda (a b) (declare (ignore a b)) t) :start n :count 1)) What is the best way of doing this? How about (defun set-nth4 (list n val) (loop for i from 0 for j in list collect (if (= i n) val j))) Perhaps we should

Okay, final question and I'll have finished my number guessing game in Common Lisp! :D Whenever the game starts (or a new game begins after the first game), the following function is called. ;;; Play the game (defun play () ;; If it's their first time playing this session, ;; make sure to greet the user. (unless (> *number-of-guesses* 0) (welcome-user)) ;; Reset their remaining guesses (setq *number-of-guesses* 0) ;; Set the target value (setq *target* ;; Random can return float values, ;; so we must round the result to get ;; an integer value. (round ;; Add one to the result, because ;;