Author: Dan Andersson
Date: 15:21:42 06/29/04
Go up one level in this thread
A tall order with both the GA and the later GP part. Merely choosing the right set of terminal symbols is hard. I assume you have looked to variations of pure GP to increase efficiency. F.ex: The Fair Crossover (or Forth Crossover), Gene Expression Programming, linear gene representations and controlling code bloat. Yngvi Bjornsson published some paper using Temporal Learning of extension values and Multi Cut Pruning in Chess. It might be a good read. I wish you Good luck, and ungodly processing power. MvH Dan Andersson
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.