Xref: utzoo comp.lang.prolog:1361 comp.ai:2426
Path: utzoo!yunexus!geac!syntron!jtsv16!uunet!husc6!think!ames!ncar!tank!mimsy!nau
From: nau@mimsy.UUCP (Dana S. Nau)
Newsgroups: comp.lang.prolog,comp.ai
Subject: Re: functions for heuristics
Keywords: generate heuristics
Message-ID: <14143@mimsy.UUCP>
Date: 24 Oct 88 21:57:38 GMT
Article-I.D.: mimsy.14143
References: <6746@pasteur.Berkeley.EDU>
Reply-To: nau@mimsy.umd.edu.UUCP (Dana S. Nau)
Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742
Lines: 15

In article <6746@pasteur.Berkeley.EDU> carasso@cory.Berkeley.EDU.UUCP (George of the Jungle) writes:
>I was interested in designing an experimental program, where the program
>would try to solve a problem by using various heuristics. ... If a heuristic
>is successful, then it creates mutant heuristic versions of itself, and then
>those heuristics are put to the test, et cetera. ...

Ping-Chung Chi has done a nice Ph.D. dissertation at the University of
Maryland, studying game tree searching.  Among other things, he has done
the above on game trees using a genetic algorithms approach.  For more
information, write to chi@mimsy.umd.edu.
-- 
Dana S. Nau
Computer Science Dept.		ARPA & CSNet:  nau@mimsy.umd.edu
University of Maryland		UUCP:  ...!{allegra,uunet}!mimsy!nau
College Park, MD 20742		Telephone:  (301) 454-7932