Skip to main content
Erschienen in: Soft Computing 4/2010

01.04.2010 | Original Paper

History mechanism supported differential evolution for chess evaluation function tuning

verfasst von: B. Bošković, J. Brest, A. Zamuda, S. Greiner, V. Žumer

Erschienen in: Soft Computing | Ausgabe 4/2010

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper presents a differential evolution (DE) based approach to chess evaluation function tuning. DE with opposition-based optimization is employed and upgraded with a history mechanism to improve the evaluation of individuals and the tuning process. The general idea is based on individual evaluations according to played games through several generations and different environments. We introduce a new history mechanism which uses an auxiliary population containing good individuals. This new mechanism ensures that good individuals remain within the evolutionary process, even though they died several generations back and later can be brought back into the evolutionary process. In such a manner the evaluation of individuals is improved and consequently the whole tuning process.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Fußnoten
1
BBChess is a free open source chess program available at: http://​labraj.​uni-mb.​si/​-borko/​bbchess.
 
2
Universal Chess Interface (UCI) is an open communication protocol that enables a chess program to communicate with its user interface, in our case the tuning algorithm.
 
3
PolyGlot is a free “UCI adapter”. It connects a UCI chess program to an xboard interface and also simple tool to create an opening book.
 
4
The Bayeselo is a freeware tool to estimate maximum-likelihood ratings made by Rémi Coulom and available at: http://​remi.​coulom.​free.​fr/​Bayesian-Elo/​.
 
5
CCRL is a Computer Chess Rating Lists. It is a club of people inspired by watching computers play chess and compare the strengths of different chess programs, available at: http://​computerchess.​org.​uk/​.
 
Literatur
Zurück zum Zitat Anantharaman TS (1990) A statistical study of selective min–max search in computer chess. Ph.D. thesis, Carnegie Mellon University Pittsburgh, USA Anantharaman TS (1990) A statistical study of selective min–max search in computer chess. Ph.D. thesis, Carnegie Mellon University Pittsburgh, USA
Zurück zum Zitat Anantharaman TS (1997) Evaluation tuning for computer chess: linear discriminant methods. ICCA J 20(4):224–242 Anantharaman TS (1997) Evaluation tuning for computer chess: linear discriminant methods. ICCA J 20(4):224–242
Zurück zum Zitat Baxter J, Tridgell A, Weaver L (1998) Experiments in parameter learning using temporal differences. Int Comput Chess Assoc J 21(2):84–99 Baxter J, Tridgell A, Weaver L (1998) Experiments in parameter learning using temporal differences. Int Comput Chess Assoc J 21(2):84–99
Zurück zum Zitat Baxter J, Tridgell A, Weaver L (2000) Learning to play chess using temporal differences. Mach Learn 40(3):243–263MATHCrossRef Baxter J, Tridgell A, Weaver L (2000) Learning to play chess using temporal differences. Mach Learn 40(3):243–263MATHCrossRef
Zurück zum Zitat Beal DF, Smith MC (1997) Learning piece values using temporal differences. J Int Comput Chess Assoc 20(3):147–151 Beal DF, Smith MC (1997) Learning piece values using temporal differences. J Int Comput Chess Assoc 20(3):147–151
Zurück zum Zitat Beal DF, Smith MC (1999) Learning piece-square values using temporal differences. ICCA J 22(4):223–235 Beal DF, Smith MC (1999) Learning piece-square values using temporal differences. ICCA J 22(4):223–235
Zurück zum Zitat Bošković B, Greiner S, Brest J, Žumer V (2006) A differential evolution for the tuning of a chess evaluation function. In: The 2006 IEEE congress on evolutionary computation CEC2006. IEEE Press, New Jersey, pp 6742–6747 Bošković B, Greiner S, Brest J, Žumer V (2006) A differential evolution for the tuning of a chess evaluation function. In: The 2006 IEEE congress on evolutionary computation CEC2006. IEEE Press, New Jersey, pp 6742–6747
Zurück zum Zitat Bošković B, Greiner S, Brest J, Zamuda A, Žumer V (2008) An adaptive differential evolution algorithm with opposition-based mechanisms, applied to the tuning of a chess program. In: Chakraborty UK (ed) Advances in differential evolution, studies in computational intelligence, vol 143. Springer, Berlin Bošković B, Greiner S, Brest J, Zamuda A, Žumer V (2008) An adaptive differential evolution algorithm with opposition-based mechanisms, applied to the tuning of a chess program. In: Chakraborty UK (ed) Advances in differential evolution, studies in computational intelligence, vol 143. Springer, Berlin
Zurück zum Zitat Brest J, Maučec MS (2008) Population size reduction for the differential evolution algorithm. Appl Intell 29(3):228–247CrossRef Brest J, Maučec MS (2008) Population size reduction for the differential evolution algorithm. Appl Intell 29(3):228–247CrossRef
Zurück zum Zitat Brest J, Greiner S, Bošković B, Mernik M, Žumer V (2006) Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans Evol Comput 10(6):646–657CrossRef Brest J, Greiner S, Bošković B, Mernik M, Žumer V (2006) Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans Evol Comput 10(6):646–657CrossRef
Zurück zum Zitat Brest J, Bošković B, Greiner S, Žumer V, Maučec MS (2007) Performance comparison of self-adaptive and adaptive differential evolution algorithms. Soft Comput Fusion Found Methodol Appl 11(7):617–629MATH Brest J, Bošković B, Greiner S, Žumer V, Maučec MS (2007) Performance comparison of self-adaptive and adaptive differential evolution algorithms. Soft Comput Fusion Found Methodol Appl 11(7):617–629MATH
Zurück zum Zitat Caponio A, Neri F, Tirronen V (2009) Super-fit control adaptation in memetic differential evolution frameworks. Soft Comput 13(8–9):811–831CrossRef Caponio A, Neri F, Tirronen V (2009) Super-fit control adaptation in memetic differential evolution frameworks. Soft Comput 13(8–9):811–831CrossRef
Zurück zum Zitat Chellapilla K, Fogel DB (1999) Evolving neural networks to play checkers without relying on expert knowledge. IEEE Trans Neural Netw 10(6):1382–1391CrossRef Chellapilla K, Fogel DB (1999) Evolving neural networks to play checkers without relying on expert knowledge. IEEE Trans Neural Netw 10(6):1382–1391CrossRef
Zurück zum Zitat Chellapilla K, Fogel DB (2001) Evolving an expert checkers playing program without using human expertise. IEEE Trans Evol Comput 5(4):422–428CrossRef Chellapilla K, Fogel DB (2001) Evolving an expert checkers playing program without using human expertise. IEEE Trans Evol Comput 5(4):422–428CrossRef
Zurück zum Zitat Clark D (1997) Deep thoughts on deep blue. IEEE Exp Intell Syst Appl 12(4):31 Clark D (1997) Deep thoughts on deep blue. IEEE Exp Intell Syst Appl 12(4):31
Zurück zum Zitat Demšar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1–30MathSciNet Demšar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1–30MathSciNet
Zurück zum Zitat Feoktistov V (2006) Differential evolution: in search of solutions (Springer optimization and its applications). Springer, New YorkMATH Feoktistov V (2006) Differential evolution: in search of solutions (Springer optimization and its applications). Springer, New YorkMATH
Zurück zum Zitat Fogel DB (2006) Evolutionary computation: toward a new philosophy of machine intelligence, 3rd edn. Wiley-IEEE Press, New Jersey Fogel DB (2006) Evolutionary computation: toward a new philosophy of machine intelligence, 3rd edn. Wiley-IEEE Press, New Jersey
Zurück zum Zitat Fogel DB, Hays TJ, Hahn SL, Quon J (2004) A self-learning evolutionary chess program. Proc IEEE 92(12):1947–1954CrossRef Fogel DB, Hays TJ, Hahn SL, Quon J (2004) A self-learning evolutionary chess program. Proc IEEE 92(12):1947–1954CrossRef
Zurück zum Zitat Fogel DB, Hays TJ, Hahn SL, Quon J (2006) The Blondie25 chess program competes against Fritz 8.0 and a human chess master. In: Louis SJ, Kendall G (eds) The 2006 IEEE symposium on computational intelligence and games. IEEE Press, New Jersey, pp 230–235 Fogel DB, Hays TJ, Hahn SL, Quon J (2006) The Blondie25 chess program competes against Fritz 8.0 and a human chess master. In: Louis SJ, Kendall G (eds) The 2006 IEEE symposium on computational intelligence and games. IEEE Press, New Jersey, pp 230–235
Zurück zum Zitat García S, Herrera F (2008) An extension on “statistical comparisons of classifiers over multiple data sets” for all pairwise comparisons. J Mach Learn Res 9:2677–2694 García S, Herrera F (2008) An extension on “statistical comparisons of classifiers over multiple data sets” for all pairwise comparisons. J Mach Learn Res 9:2677–2694
Zurück zum Zitat Gomboc D, Buro M, Marsland TA (2005) Tuning evaluation functions by maximizing concordance. Theor Comput Sci 349(2):202–229MathSciNetMATHCrossRef Gomboc D, Buro M, Marsland TA (2005) Tuning evaluation functions by maximizing concordance. Theor Comput Sci 349(2):202–229MathSciNetMATHCrossRef
Zurück zum Zitat Heinz EA (1999) Scalable search in computer chess: algorithmic enhancements and experiments at high search depths (computational intelligence). Morgan Kaufmann, San Francisco Heinz EA (1999) Scalable search in computer chess: algorithmic enhancements and experiments at high search depths (computational intelligence). Morgan Kaufmann, San Francisco
Zurück zum Zitat Hsu FH, Anantharaman TS, Campbell MS, Nowatzyk A (1990) Deep thought. In: Marsland TA, Schaeffer J (eds) Computers, chess and cognition, chap 5. Springer, Berlin, pp 55–78 Hsu FH, Anantharaman TS, Campbell MS, Nowatzyk A (1990) Deep thought. In: Marsland TA, Schaeffer J (eds) Computers, chess and cognition, chap 5. Springer, Berlin, pp 55–78
Zurück zum Zitat Fürnkranz J (2001) Machine learning in games: a survey. In: Fürnkranz J, Kubat M (eds) Machines that learn to play games. Nova Science Publishers, Inc., Hauppauge, pp 11–59 Fürnkranz J (2001) Machine learning in games: a survey. In: Fürnkranz J, Kubat M (eds) Machines that learn to play games. Nova Science Publishers, Inc., Hauppauge, pp 11–59
Zurück zum Zitat Kendall G, Whitwell G (2001) An evolutionary approach for the tuning of a chess evaluation function using population dynamics. In: Proceedings of the 2001 congress on evolutionary computation CEC2001. IEEE Press, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea, pp 995–1002 Kendall G, Whitwell G (2001) An evolutionary approach for the tuning of a chess evaluation function using population dynamics. In: Proceedings of the 2001 congress on evolutionary computation CEC2001. IEEE Press, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea, pp 995–1002
Zurück zum Zitat Lacrosse M (2008) Private communication Lacrosse M (2008) Private communication
Zurück zum Zitat Levinson R, Snyder R (1991) Adaptive pattern-oriented chess. AAAI pp 601–606 Levinson R, Snyder R (1991) Adaptive pattern-oriented chess. AAAI pp 601–606
Zurück zum Zitat Mysliwietz P (1994) Konstruktion und Optimierung von Bewertungsfunktionen beim Schach.(1994). Ph.D. thesis, University of Paderborn, Germany Mysliwietz P (1994) Konstruktion und Optimierung von Bewertungsfunktionen beim Schach.(1994). Ph.D. thesis, University of Paderborn, Germany
Zurück zum Zitat Nasreddine H, Poh H, Kendall G (2006) Using an evolutionary algorithm for the tuning of a chess evaluation function based on a dynamic boundary strategy. In: Proceedings of 2006 IEEE international conference on cybernetics and intelligent systems (CIS2006), pp 1–6 Nasreddine H, Poh H, Kendall G (2006) Using an evolutionary algorithm for the tuning of a chess evaluation function based on a dynamic boundary strategy. In: Proceedings of 2006 IEEE international conference on cybernetics and intelligent systems (CIS2006), pp 1–6
Zurück zum Zitat Price KV, Storn RM, Lampinen JA (2005) Differential evolution. A practical approach to global optimization. Springer, Berlin Price KV, Storn RM, Lampinen JA (2005) Differential evolution. A practical approach to global optimization. Springer, Berlin
Zurück zum Zitat Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm With strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398–417CrossRef Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm With strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398–417CrossRef
Zurück zum Zitat Quian B, Wang L, Huang DX, Wang X (2009) Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution. Soft Comput 13(8–9):847–869CrossRef Quian B, Wang L, Huang DX, Wang X (2009) Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution. Soft Comput 13(8–9):847–869CrossRef
Zurück zum Zitat Rahnamayan S, Tizhoosh HR, Salama MMA (2006) Opposition-based differential evolution algorithms. In: The 2006 IEEE congress on evolutionary computation CEC 2006, pp 7363–7370 Rahnamayan S, Tizhoosh HR, Salama MMA (2006) Opposition-based differential evolution algorithms. In: The 2006 IEEE congress on evolutionary computation CEC 2006, pp 7363–7370
Zurück zum Zitat Rahnamayan S, Tizhoosh HR, Salama MMA (2008) Opposition-based differential evolution. IEEE Trans Evol Comput 12(1):64–79CrossRef Rahnamayan S, Tizhoosh HR, Salama MMA (2008) Opposition-based differential evolution. IEEE Trans Evol Comput 12(1):64–79CrossRef
Zurück zum Zitat Samuel AL (1959) Some studies in machine learning using the game of checkers. IBM J Res Development 3(3):211–229MathSciNet Samuel AL (1959) Some studies in machine learning using the game of checkers. IBM J Res Development 3(3):211–229MathSciNet
Zurück zum Zitat Samuel AL (1967) Some studies in machine learning using the game of checkers. II—recent progress. IBM J Res Development 11(6):601–617CrossRef Samuel AL (1967) Some studies in machine learning using the game of checkers. II—recent progress. IBM J Res Development 11(6):601–617CrossRef
Zurück zum Zitat Shih FY, Edupuganti VG (2009) A differential evolution based algorithm for breaking the visual steganaliytic system. Soft Comput 13(4):345–353CrossRef Shih FY, Edupuganti VG (2009) A differential evolution based algorithm for breaking the visual steganaliytic system. Soft Comput 13(4):345–353CrossRef
Zurück zum Zitat Storn R, Price K (1995) Differential evolution—a simple and efficient adaptive scheme for global optimization over continuous spaces. Technical Report TR-95-012, Berkeley, CA, USA Storn R, Price K (1995) Differential evolution—a simple and efficient adaptive scheme for global optimization over continuous spaces. Technical Report TR-95-012, Berkeley, CA, USA
Zurück zum Zitat Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimisation over continuous spaces. J Global Optim 11:341–359MathSciNetMATHCrossRef Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimisation over continuous spaces. J Global Optim 11:341–359MathSciNetMATHCrossRef
Zurück zum Zitat Teng NS, Teo J, Hijazi MHA (2009) Self-adaptive population sizing for a tune-free differential evolution. Soft Comput 13(7):709–724CrossRef Teng NS, Teo J, Hijazi MHA (2009) Self-adaptive population sizing for a tune-free differential evolution. Soft Comput 13(7):709–724CrossRef
Zurück zum Zitat Teo J (2006) Exploring dynamic self-adaptive populations in differential evolution. Soft Comput 10(8):673–686CrossRef Teo J (2006) Exploring dynamic self-adaptive populations in differential evolution. Soft Comput 10(8):673–686CrossRef
Zurück zum Zitat Tesauro G (2001) Comparison training of chess evaluation functions. In: Furnkranz J, Kubat M (eds) Machines that learn to play games. Nova Science Publishers, Hauppauge, pp 117–130 Tesauro G (2001) Comparison training of chess evaluation functions. In: Furnkranz J, Kubat M (eds) Machines that learn to play games. Nova Science Publishers, Hauppauge, pp 117–130
Zurück zum Zitat Thrun S (1995) Learning to play the game of chess. In: Tesauro G, Touretzky D, Leen T (eds) Advances in neural information processing systems 7. The MIT Press, Cambridge, MA, pp 1069–1076 Thrun S (1995) Learning to play the game of chess. In: Tesauro G, Touretzky D, Leen T (eds) Advances in neural information processing systems 7. The MIT Press, Cambridge, MA, pp 1069–1076
Zurück zum Zitat Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: Proceedings of international conference on computational intelligence for modelling control and automation—CIMCA 2005, Vienna, Austria, pp 695–701 Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: Proceedings of international conference on computational intelligence for modelling control and automation—CIMCA 2005, Vienna, Austria, pp 695–701
Metadaten
Titel
History mechanism supported differential evolution for chess evaluation function tuning
verfasst von
B. Bošković
J. Brest
A. Zamuda
S. Greiner
V. Žumer
Publikationsdatum
01.04.2010
Verlag
Springer-Verlag
Erschienen in
Soft Computing / Ausgabe 4/2010
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-010-0593-z

Weitere Artikel der Ausgabe 4/2010

Soft Computing 4/2010 Zur Ausgabe

Premium Partner