mirror of
https://git.savannah.gnu.org/git/emacs.git
synced 2024-12-10 09:12:15 +00:00
Minor copyedits in landmark.el
* lisp/obsolete/landmark.el: Fix author's email and commentary.
This commit is contained in:
parent
081fb694c3
commit
85516b8cc8
@ -2,7 +2,7 @@
|
||||
|
||||
;; Copyright (C) 1996-1997, 2000-2018 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
|
||||
;; Version: 1.0
|
||||
@ -36,7 +36,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
|
||||
@ -53,6 +53,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.
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user