[Push] Evolving data structures?

[Lee Spector]

Some of my students have used Push to evolve players for various games, but I don't remember any representing move trees explicitly. 

I agree with PerPlex Ed that it would be possible for the native list representations to evolve to be used as move trees, but if you know that a particular type would be handy then it's often a good idea to add it explicitly. There are two obvious options for this: 1) add it as a new, first-class type with its own stack and manipulation instructions, etc., or 2) build and manipulate a single move tree that you store separately from the stacks, and just write a few new instructions that take info from existing stacks, access/modify the move tree, and push results back on the existing stacks. I often use tactic 2 just because it requires less coding, but in some cases (e.g. with quantum gates) I've added whole new types. The details of doing this will vary from implementation to implementation.

 -Lee


On Jun 21, 2010, at 11:21 PM, Kenneth Chua wrote:

> Hi,
> 
> Is it possible in the Push language for a data structure to evolve, such as a tree? I'm attempting to use Push to evolve a game-playing engine. A move-tree might be handy for an individual to have. Has anyone tried to use Push to evolve a game-playing engine?
> 
> Thanks,
> Ken
> 
> Hotmail has tools for the New Busy. Search, chat and e-mail from your inbox. Learn more. _______________________________________________
> Push mailing list
> Push at lists.hampshire.edu
> https://lists.hampshire.edu/mailman/listinfo/push

--
Lee Spector, Professor of Computer Science
School of Cognitive Science, Hampshire College
893 West Street, Amherst, MA 01002-3359
lspector at hampshire.edu, http://hampshire.edu/lspector/
Phone: 413-559-5352, Fax: 413-559-5438

Check out Genetic Programming and Evolvable Machines:
http://www.springer.com/10710 - http://gpemjournal.blogspot.com/