{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:20Z","timestamp":1740122660286,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,4,21]],"date-time":"2017-04-21T00:00:00Z","timestamp":1492732800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005783","name":"University of Kashan","doi-asserted-by":"publisher","award":["13452"],"award-info":[{"award-number":["13452"]}],"id":[{"id":"10.13039\/501100005783","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10489-017-0918-z","type":"journal-article","created":{"date-parts":[[2017,4,21]],"date-time":"2017-04-21T02:01:27Z","timestamp":1492740087000},"page":"752-768","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A GA based method for search-space reduction of chess game-tree"],"prefix":"10.1007","volume":"47","author":[{"given":"Hootan","family":"Dehghani","sequence":"first","affiliation":[]},{"given":"Seyed Morteza","family":"Babamir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,21]]},"reference":[{"key":"918_CR1","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"CE Shannon","year":"1950","unstructured":"Shannon C E (1950) XXII. Programming a computer for playing chess. Philos Mag 41:256\u2013275","journal-title":"Philos Mag"},{"key":"918_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-11678-0","volume-title":"Knowledge-free and learning-based methods in intelligent game playing","author":"J Mandziuk","year":"2010","unstructured":"Mandziuk J (2010) Knowledge-free and learning-based methods in intelligent game playing. Springer, Berlin"},{"key":"918_CR3","unstructured":"Tim Jones M (2008) Artificial intelligence: a systems approach. Jone & Bartlett Learning Publication, ISBN-13: 9780763773373"},{"key":"918_CR4","unstructured":"Bowden B V (1953) Faster than thought. In: A symposium on digital computing machines. Pitman Publishing"},{"key":"918_CR5","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/40.755469","volume":"19","author":"F-H Hsu","year":"1999","unstructured":"Hsu F-H (1999) IBM\u2019s deep blue chess grandmaster chips. IEEE Micro 19:70\u201381","journal-title":"IEEE Micro"},{"key":"918_CR6","unstructured":"Dehghani H, Babamir SM (2015) Effectiveness analysis of genetic algorithm for chess game tree search. In: The 8th international conference of iranian operations research society, pp 251\u2013253"},{"key":"918_CR7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1162\/106365601750406046","volume":"9","author":"T-P Hong","year":"2001","unstructured":"Hong T-P, Huang K-Y, Lin W-Y (2001) Adversarial search by evolutionary computation. Evol Comput 9:371\u2013385","journal-title":"Evol Comput"},{"key":"918_CR8","doi-asserted-by":"crossref","unstructured":"David O, van den Herik J, Koppel M, Netanyahu N (2014) Genetic algorithms for evolving computer chess programs. In: IEEE transactions on evolutionary computation","DOI":"10.1109\/TEVC.2013.2285111"},{"key":"918_CR9","doi-asserted-by":"crossref","first-page":"3234","DOI":"10.1016\/j.asoc.2013.02.015","volume":"13","author":"E V\u00e1zquez-Fern\u00e1ndez","year":"2013","unstructured":"V\u00e1zquez-Fern\u00e1ndez E, Coello C A C, Troncoso F D S (2013) An evolutionary algorithm with a history mechanism for tuning a chess evaluation function. Appl Soft Comput 13:3234\u20133247","journal-title":"Appl Soft Comput"},{"key":"918_CR10","doi-asserted-by":"crossref","unstructured":"Nasreddine H, Poh H S, Kendall G (2006) Using an evolutionary algorithm for the tuning of a chess evaluation function based on a dynamic boundary strategy. In: IEEE conference on cybernetics and intelligent systems, pp 1\u20136","DOI":"10.1109\/ICCIS.2006.252366"},{"key":"918_CR11","first-page":"18","volume":"22","author":"K Price","year":"1997","unstructured":"Price K, Storn R (1997) Differential evolution\u2013a simple evolution strategy for fast optimization. Dr. Dobb\u2019s J 22:18\u201324","journal-title":"Dr. Dobb\u2019s J"},{"key":"918_CR12","unstructured":"Price K, Storn R M, Lampinen J A (2006) Differential evolution: a practical approach to global optimization: Springer Science & Business Media"},{"key":"918_CR13","doi-asserted-by":"crossref","unstructured":"Ronkkonen J, Kukkonen S, Price K V (2005) Real-parameter optimization with differential evolution. In: IEEE congress on evolutionary computation. Edinburgh, pp 506\u2013513","DOI":"10.1109\/CEC.2005.1554725"},{"key":"918_CR14","doi-asserted-by":"crossref","unstructured":"Boskovic B, Greiner S, Brest J, Zumer V (2006) A differential evolution for the tuning of a chess evaluation function. In: IEEE congress on evolutionary computation. Vancouver, pp 1851\u20131856","DOI":"10.1109\/CEC.2006.1688532"},{"key":"918_CR15","doi-asserted-by":"crossref","unstructured":"Hauptman A (2005) GP-EndChess: using genetic programming to evolve chess endgame players. In: The 8th European conference on genetic programming. Switzerland, pp 120\u2013131","DOI":"10.1007\/978-3-540-31989-4_11"},{"key":"918_CR16","doi-asserted-by":"crossref","unstructured":"Hauptman A, Sipper M (2007) Evolution of an efficient search algorithm for the mate-in-N problem in chess. In: The 10th European conference on genetic programming, pp 78\u201389","DOI":"10.1007\/978-3-540-71605-1_8"},{"key":"918_CR17","unstructured":"Laws of Chess. Available: http:\/\/www.fide.com\/component\/handbook\/?id=124&view=article , Access Date: 29-7-2016"},{"key":"918_CR18","doi-asserted-by":"crossref","unstructured":"Veness J, Bair A (2007) Effective use of transposition table in stochastic game tree search. In: IEEE symposium on computational intelligence and games, pp 112\u2013116","DOI":"10.1109\/CIG.2007.368086"},{"key":"918_CR19","doi-asserted-by":"crossref","unstructured":"Millington I, Funge J (2009) Artificial intelligence for games, 2nd edn. Morgan Kaufmann, Elsevier","DOI":"10.1016\/B978-0-12-374731-0.00002-5"},{"key":"918_CR20","unstructured":"http:\/\/chessprogramming.wikispaces\/UCI , Access Date: 20-2-2016"},{"key":"918_CR21","unstructured":"http:\/\/hgm.nubati.net , Access Date: 20-2-2016"},{"key":"918_CR22","volume-title":"The algorithm design manual","author":"SS Skiena","year":"2009","unstructured":"Skiena S S (2009) The algorithm design manual. Springer, London"},{"key":"918_CR23","unstructured":"http:\/\/chessprogramming.wikispaces\/Winglet , Access Date: 20-2-2016"},{"key":"918_CR24","unstructured":"https:\/\/stockfishchess.org , Access Date: 20-2-2015"},{"key":"918_CR25","unstructured":"Hellsten J (2010) Mastering chess strategy. Everyman Chess"},{"key":"918_CR26","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1207\/s15516709cog2704_3","volume":"27","author":"CF Chabris","year":"2003","unstructured":"Chabris C F, Hearst E S (2003) Visualization, pattern recognition, and forward search: effects of playing speed and sight of the position on grandmaster chess errors. Cogn Sci 27:637\u2013 648","journal-title":"Cogn Sci"},{"key":"918_CR27","unstructured":"Wilson F, Alberston B (1999) 303 tricky chess tactics. Cardoza Publishing"},{"key":"918_CR28","unstructured":"http:\/\/chessprogramming.wikispaces.com\/Ufim , Access Date: 29-7-2016"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-0918-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0918-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0918-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T09:19:53Z","timestamp":1569057593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-0918-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,21]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["918"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-0918-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2017,4,21]]}}}