[elpa] externals/landmark 2ab5c1c 5/7: * landmark/landmark.el (Commentary): Mention algorithm's origin

[Stefan Monnier]

branch: externals/landmark
commit 2ab5c1c612344373783616c6c2f9f1436ec84de3
Author: Stefan Monnier <monnier@iro.umontreal.ca>
Commit: Stefan Monnier <monnier@iro.umontreal.ca>

    * landmark/landmark.el (Commentary): Mention algorithm's origin
---
 landmark.el | 11 +++++++++--
 1 file changed, 9 insertions(+), 2 deletions(-)

diff --git a/landmark.el b/landmark.el
index 9b48901..b1ffd8a 100644
--- a/landmark.el
+++ b/landmark.el
@@ -2,7 +2,7 @@
 
 ;; Copyright (C) 1996-1997, 2000-2016 Free Software Foundation, Inc.
 
-;; Author: Terrence Brannon (was: <brannon@rana.usc.edu>)
+;; Author: Terrence Brannon <metaperl@gmail.com>
 ;; Created: December 16, 1996 - first release to usenet
 ;; Keywords: games, neural network, adaptive search, chemotaxis
 ;; Maintainer: emacs-devel@gnu.org
@@ -34,7 +34,7 @@
 ;; the smell of the tree increases, then the weights in the robot's
 ;; brain are adjusted to encourage this odor-driven behavior in the
 ;; future. If the smell of the tree decreases, the robots weights are
-;; adjusted to discourage a correct move.
+;; adjusted to discourage that odor-driven behavior.
 
 ;; In laymen's terms, the search space is initially flat. The point
 ;; of training is to "turn up the edges of the search space" so that
@@ -51,6 +51,13 @@
 ;; a single move, one moves east,west and south, then both east and
 ;; west will be improved when they shouldn't
 
+;; The source code was developed as part of a course on Brain Theory
+;; and Neural Networks at the University of Southern California. The
+;; original problem description and solution appeared in 1981 in the
+;; paper "Landmark Learning: An Illustration of Associative
+;; Search" authored by Andrew G. Barto and Richard S. Sutton and
+;; published to Biological Cybernetics.
+
 ;; Many thanks to Yuri Pryadkin <yuri@rana.usc.edu> for this
 ;; concise problem description.