{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:01:49Z","timestamp":1767337309727},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T00:00:00Z","timestamp":1123804800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1007\/s10710-005-2990-0","type":"journal-article","created":{"date-parts":[[2005,8,16]],"date-time":"2005-08-16T11:35:01Z","timestamp":1124192101000},"page":"283-300","source":"Crossref","is-referenced-by-count":31,"title":["GP-Gammon: Genetically Programming Backgammon Players"],"prefix":"10.1007","volume":"6","author":[{"given":"Yaniv","family":"Azaria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Sipper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,8,12]]},"reference":[{"key":"2990_CR1","volume-title":"The Atomic Components of Thought","author":"J. R. Anderson","year":"1998","unstructured":"J. R. Anderson, and C. Lebiere, The Atomic Components of Thought, Lawrence Erlbaum Associates: Mahwah, NJ, 1998."},{"key":"2990_CR2","unstructured":"K. Chellapilla, \u201cA preliminary investigation into evolving modular programs without subtree crossover,\u201d. in, Genetic Programming 1998: Proceedings of the Third Annual Conference, J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. Riolo (Eds.). University of Wisconsin, Madison, Wisconsin, USA, 1998, pp. 23\u201331."},{"key":"2990_CR3","unstructured":"F. Dahl, \u201cJellyFish Backgammon,\u201d 1998\u20132004. http:\/\/www.jellyfish-backgammon.com."},{"key":"2990_CR4","doi-asserted-by":"crossref","unstructured":"P. Darwen, \u201cWhy co-evolution beats temporal-difference learning at backgammon for a linear architecture, but not a non-linear architecture,\u201d in Proceedings of the 2001 Congress on Evolutionary Computation (CEC-01). Seoul Korea, 2001, pp. 1003\u20131010.","DOI":"10.1109\/CEC.2001.934300"},{"key":"2990_CR5","unstructured":"R. Gross, K. Albrecht, W. Kantschik, and W. Banzhaf, \u201cEvolving chess playing programs,\u201d in, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, W. B. Langdon, E. Cant\u00fa-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. A. Potter, A. C. Schultz, J. F. Miller, E. Burke, and N. Jonoska (Eds.). New York, 2002, pp. 740\u2013747."},{"key":"2990_CR6","doi-asserted-by":"crossref","unstructured":"A. Hauptman, and M. Sipper, \u201cGP-EndChess: Using genetic programming to evolve chess endgame players,\u201d in Proceedings of 8th European Conference on Genetic Programming (EuroGP2005), M. Keijzer, A. Tettamanzi, P. Collet, J. van Hemert, and M. Tomassini, (Eds), vol. 3447 of Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, 2005, pp. 120\u2013131.","DOI":"10.1007\/978-3-540-31989-4_11"},{"key":"2990_CR7","volume-title":"Genetic programming: On the Programming of Computers by Means of Natural Selection","author":"J. R. Koza","year":"1992","unstructured":"J. R. Koza, Genetic programming: On the Programming of Computers by Means of Natural Selection. MIT Press: Cambridge, MA, 1992."},{"key":"2990_CR8","volume-title":"Genetic Programming II: Automatic Discovery of Reusable Programs)","author":"J. R. Koza","year":"1994","unstructured":"J. R. Koza, Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press: Cambridge, Massachusetts, 1994."},{"key":"2990_CR9","volume-title":"Genetic Programming III: Darwinian Invention and Problem Solving","author":"J. R. Koza","year":"1999","unstructured":"J. R. Koza, F. H. Bennett III, D. Andre, and M. A. Keane, Genetic Programming III: Darwinian Invention and Problem Solving, Morgan Kaufmann: San Francisco, California, 1999."},{"issue":"2","key":"2990_CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1162\/evco.1995.3.2.199","volume":"3","author":"D. J. Montana","year":"1995","unstructured":"D. J. Montana, \u201cStrongly typed genetic programming,\u201d Evolutionary Computation, vol. 3, no. 2, pp. 199\u2013230, 1995.","journal-title":"Evolutionary Computation"},{"key":"2990_CR11","unstructured":"J. B. Pollack, A. D. Blair, and M. Land, \u201cCoevolution of a backgammon player,\u201d in, Artificial Life V: Proceedings of the Fifth International Workshop on the Synthesis and Simulation of Living Systems, C. G. Langton and K. Shimohara (Eds.), Cambridge, MA, 1997, pp. 92\u201398."},{"key":"2990_CR12","unstructured":"J. B. Pollack, A. D. Blair, and M. Land, \u201cDEMO Lab\u201ds HC-Gammon\u201d, 1997. http:\/\/demo.cs.brandeis.edu\/bkg.html."},{"key":"2990_CR13","unstructured":"D. Qi, and R. Sun, \u201cIntegrating reinforcement learning, bidding and genetic algorithms,\u201d in Proceedings of the International Conference on Intelligent Agent Technology (IAT-2003), 2003, pp. 53\u201359."},{"issue":"3","key":"2990_CR14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1162\/106454699568755","volume":"5","author":"E. M. A. Ronald","year":"1999","unstructured":"E. M. A. Ronald, M. Sipper, and M. S. Capcarr\u00e8re, \u201cDesign, Observation, Surprise! A Test of Emergence,\u201d Artificial Life vol. 5, no. 3, pp. 225\u2013239, 1999.","journal-title":"Artificial Life"},{"key":"2990_CR15","unstructured":"S. Sanner, J. R. Anderson, C. Lebiere, and M. Lovett, \u201cAchieving efficient and cognitively plausible learning in backgammon,\u201d in, Proceedings of the 17th International Conference on Machine Learning (ICML-2000), P. Langley (Ed.), Stanford, CA, 2000, pp. 823\u2013830."},{"key":"2990_CR16","doi-asserted-by":"crossref","unstructured":"Y. Shichel, E. Ziserman, and M. Sipper, \u201cGP-Robocode: Using genetic programming to evolve robocode players,\u201d in Proceedings of 8th European Conference on Genetic Programming (Euro GP2005), M. Keijzer, A. Tettamanzi, P. Collet, J. van Hemert, and M. Tomassini, (Eds), vol. 3447 of Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, 2005, pp. 143\u2013154.","DOI":"10.1007\/978-3-540-31989-4_13"},{"issue":"4","key":"2990_CR17","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/1099-0526(200003\/04)5:4<31::AID-CPLX4>3.0.CO;2-9","volume":"5","author":"M. Sipper","year":"2000","unstructured":"M. Sipper, \u201cA success story or an old wives' Tale? On judging experiments in evolutionary computation,\u201d Complexity, vol. 5, no. 4, pp. 31\u201333, 2000.","journal-title":"Complexity"},{"issue":"7","key":"2990_CR18","first-page":"78","volume":"1","author":"G. Tesauro","year":"1989","unstructured":"G. Tesauro, \u201cNEUROGAMMON: A neural-network backgammon learning program,\u201d Heuristic Programming in Artificial Intelligence, vol. 1, no. 7, pp. 78\u201380, 1989.","journal-title":"Heuristic Programming in Artificial Intelligence"},{"key":"2990_CR19","unstructured":"G. Tesauro, \u201cSoftware\u2013Source Code Benchmark player \u2018pubeval.c\u2019\u201d. http:\/\/www.bkgm.com\/rgb\/rgb.cgi?view+610 1993."},{"issue":"3","key":"2990_CR20","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/203330.203343","volume":"38","author":"G. Tesauro","year":"1995","unstructured":"G. Tesauro, \u201cTemporal difference learning and TD-Gammon,\u201d Communications of the ACM, vol. 38, no. 3, pp. 58\u201368, 1995.","journal-title":"Communications of the ACM"},{"issue":"9","key":"2990_CR21","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1109\/5.784219","volume":"87","author":"X. Yao","year":"1999","unstructured":"X. Yao, \u201cEvolving artificial neural networks,\u201d Proceedings of the IEEE, vol. 87, no. 9, pp. 1423\u20131447, 1999.","journal-title":"Proceedings of the IEEE"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-005-2990-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-005-2990-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-005-2990-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:22:03Z","timestamp":1559240523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-005-2990-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8,12]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["2990"],"URL":"https:\/\/doi.org\/10.1007\/s10710-005-2990-0","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,8,12]]}}}