Recitations

Material discussed during the recitation is listed below:

Discussion of NP Completeness

Logical Equivalences

Unification in FOL (recommended by Tyler Bienhoff)

Adverserial Search

1. Empty Game Tree (PDF)
2. Alternative Empty Game Tree (PDF)
3. Practice Alpha-Beta pruning using animation (recommended by Marcelo Florencio Sobral, Spring 2015). For a good example tree, use the following input values:
   1. Tree structure: 3 3 2 2 3 2 3 2 2 2 2
      ALERT: do NOT put space after 2 (end of input), you'll get an incorrect tree structure
   2. Utility values for terminal nodes: 7 5 0 3 12 6 17 -3 24 -5 4 -11 -1 -20 42 0
      ALERT: do NOT put space after 0 (end of input)
   3. Then, press "Create new game tree"
   4. Then, press "Run Minimax"

Installing Allegro Common Lisp

1. Using your own computer. Get your free (time-limited) version of ACL. How To Use The GNU Emacs-Allegro Common Lisp Interface.
2. Using SoC servers. Instructions on using xemacs and ACL in available environments.
3. Using the VM client. (Likely outdated) Instructions on using emacs and ACL via the VM client .

Learning Lisp

1. Very first steps in Lisp .
2. Next steps in Lisp.
3. Notes about Lisp from a former UTA.
4. Iteration with Do and Structures
5. The lisp code of the Farmer's dilemma.

Learning Emacs

1. Go, step-by-step, through the Emacs Tutorial. You can access it from emacs itself, by typing ESC-x (for entering a command in the command buffer), h (h for help), t (t for tutorial).
2. Review some most useful commands.
3. Improve your efficiency by using ACL Keystroke accelerators in Emacs.