From authors, we sometimes see the following :
"Yeah, that's deficiency X. If I fix X, then I end up hurting Y and Z, and I don't know how to fix X otherwise."
What are some thoughts on genetic algorithms to tune engine evaluations, especially in a case like the above?
Set up success/fail parameters, give it an algo, crunch for a few billion x billion x billion iterations, open the lid, see if anything crawls out...
That sort of thing..
?
*- Just found this student article -> http://www.cs.utah.edu/~wyman/classes/ML_proj/paper.html "Using Genetic Algorithms to Learn Weights for Simple King-Pawn Chess Endgames"
"Yeah, that's deficiency X. If I fix X, then I end up hurting Y and Z, and I don't know how to fix X otherwise."
What are some thoughts on genetic algorithms to tune engine evaluations, especially in a case like the above?
Set up success/fail parameters, give it an algo, crunch for a few billion x billion x billion iterations, open the lid, see if anything crawls out...
That sort of thing..
?
*- Just found this student article -> http://www.cs.utah.edu/~wyman/classes/ML_proj/paper.html "Using Genetic Algorithms to Learn Weights for Simple King-Pawn Chess Endgames"
The use of genetic algorithms is already proving to be the best method in the game of Go. In my opinion, chess programs will adopt it once the number of processors reaches the point of significant diminishing returns, which will probably be fairly soon.
I read the paper and I think it one of the most cumber sum methods of 'creating chess knowledge'. Also the results obtained (~25% score in a dozen or so well trained boards is not very encouraging). I think that genetic algorithms for chess will take many more decades to be useful to even a tiny degree. Chess is simply to complex with the different behavior of the pieces (pawn/rook/knignt etc), and even the same piece in a different position (rook before/after rocade).
Sorry, I must have been groggy, my response about GO referred to Monte Carlo methods, not genetic algorithms. I should have replied that genetic algorithms are probably promising for tuning portions of an eval function, but not the whole eval function at once as there are too many terms. My former partner in "Rexchess" and "Socrates", Don Dailey, is researching both genetic algorithms and Monte Carlo in chess and GO respectively.
Links of possible interest ...
http://www.codeproject.com/cpp/8queenssolution.asp
http://satirist.org/learn-game/methods/ga/chess.html
http://www.thycotic.net/data/M801_R4401166_J_COGLEY_dissertation.pdf
http://citeseer.ist.psu.edu/cache/papers/cs/33095/http:zSzzSzwww.stancomb.co.ukzSz~prrzSzPaperszSzseal98.pdf/reiser98evolving.pdf
ftp://cs.joensuu.fi/pub/Theses/2004_MSc_Aksenov_Petr.pdf
http://www.econ.iastate.edu/tesfatsi/holland.GAIntro.htm
http://www.springerlink.com/content/w0n7ybm74xrjgntq/?p=e9f9afb478a2402d8f83e4764f7ec82a&pi=0
Distributed Computation project (no longer active) with some data : http://neural-chess.netfirms.com/
(A pity that this - http://www.chess960athome.org/alpha/ - is moribund.)
http://www.codeproject.com/cpp/8queenssolution.asp
http://satirist.org/learn-game/methods/ga/chess.html
http://www.thycotic.net/data/M801_R4401166_J_COGLEY_dissertation.pdf
http://citeseer.ist.psu.edu/cache/papers/cs/33095/http:zSzzSzwww.stancomb.co.ukzSz~prrzSzPaperszSzseal98.pdf/reiser98evolving.pdf
ftp://cs.joensuu.fi/pub/Theses/2004_MSc_Aksenov_Petr.pdf
http://www.econ.iastate.edu/tesfatsi/holland.GAIntro.htm
http://www.springerlink.com/content/w0n7ybm74xrjgntq/?p=e9f9afb478a2402d8f83e4764f7ec82a&pi=0
Distributed Computation project (no longer active) with some data : http://neural-chess.netfirms.com/
(A pity that this - http://www.chess960athome.org/alpha/ - is moribund.)
Powered by mwForum 2.27.4 © 1999-2012 Markus Wichitill
