Xref: utzoo comp.lang.prolog:1356 comp.ai:2418
Path: utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!husc6!think!ames!pasteur!cory.Berkeley.EDU!carasso
From: carasso@cory.Berkeley.EDU (George of the Jungle)
Newsgroups: comp.lang.prolog,comp.ai
Subject: functions for heuristics
Keywords: generate heuristics
Message-ID: <6746@pasteur.Berkeley.EDU>
Date: 24 Oct 88 05:17:12 GMT
Sender: news@pasteur.Berkeley.EDU
Reply-To: carasso@cory.Berkeley.EDU.UUCP (George of the Jungle)
Organization: University of California, Berkeley
Lines: 31







I was interested in designing an experimental program, where the program
would try to solve a problem by using various heuristics.  What I would like
to do is model it after evolution.  If a heuristic is successful,
then it creates mutant heuristic versions of itself, and then those 
heuristics are put to the test, et cetera.  Each time, the ones that
solve the problem in the shortest time are allowed to have children,
others are "terminated".  

In wanting mutant children created, I do not simply want to change
some constants in the parent's fuctions, but rather would like it to 
change the function itself and create totally new ones.  In starting this
off, I also do not want to enter the base case for all the fuctions I know.
For example \x. x*x; or \x. c; or \x. x^x; or what ever fuction I could dream
up.  Is there any way to create "all function groups", within reason?
Where two functions are in the same group if they differ by a constant,
or number of repeatitions.

Of course, the eventual goal is to see the program find a good heuristic
on its own.

Roger Carasso,
UCB


"My ignorance is my own, and is no way related to any organization"