{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T09:07:18Z","timestamp":1754557638893,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/cig.2018.8490415","type":"proceedings-article","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T03:37:41Z","timestamp":1539661061000},"page":"1-8","source":"Crossref","is-referenced-by-count":5,"title":["Generating Novice Heuristics for Post-Flop Poker"],"prefix":"10.1109","author":[{"given":"Fernando","family":"de Mesentier Silva","sequence":"first","affiliation":[]},{"given":"Julian","family":"Togelius","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Lantz","sequence":"additional","affiliation":[]},{"given":"Andy","family":"Nealen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Field guide to genetic programming","year":"2008","author":"mcphee","key":"ref31"},{"key":"ref30","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-52156-5","volume":"679","author":"kramer","year":"2017","journal-title":"Genetic Algorithm Essentials"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-005-2990-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2010.5593376"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2009.5286481"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1555023"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688444"},{"journal-title":"Play Poker Like the Pros","year":"2003","author":"hellmuth","key":"ref15"},{"journal-title":"The Mathematics of Poker","year":"2006","author":"chen","key":"ref16"},{"journal-title":"The Theory of Poker","year":"1999","author":"sklansky","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2016.7860407"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205601"},{"key":"ref28","first-page":"645","article-title":"Solving heads-up limit texas hold’em","author":"tammelin","year":"2015","journal-title":"IJCAI"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90074-8"},{"key":"ref27","first-page":"1007","article-title":"A competitive texas hold’em poker player via automated abstraction and real-time equilibrium computation","volume":"21","author":"gilpin","year":"2006","journal-title":"Proceedings of the National Conference on Artificial Intelligence"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1037\/\/0033-295X.103.4.650"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1038\/nature16961","article-title":"Mastering the game of go with deep neural networks and tree search","volume":"529","author":"silver","year":"2016","journal-title":"Nature"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF00175355"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00129-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1126\/science.aam6960"},{"key":"ref7","first-page":"126","article-title":"From simple features to sophisticated evaluation functions","author":"buro","year":"1998","journal-title":"Computers and Games"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1257\/000282803322655392","article-title":"Maps of bounded rationality: Psychology for behavioral economics","volume":"93","author":"kahneman","year":"2003","journal-title":"The American Economic Review"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.781920"},{"key":"ref1","first-page":"161","article-title":"Theories of bounded rationality","volume":"1","author":"simon","year":"1972","journal-title":"Decision and Organization"},{"article-title":"Depth in strategic games","year":"2017","author":"lantz","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058680"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1126\/science.1259433"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/9780470752937.ch4"},{"key":"ref23","first-page":"3","article-title":"Isac lists, a different representation for program","author":"ashlock","year":"1998","journal-title":"Genetic Programming 1998"},{"key":"ref26","first-page":"661","article-title":"Approximating game-theoretic optimal strategies for full-scale poker","author":"billings","year":"2003","journal-title":"IJCAI"},{"key":"ref25","first-page":"1729","article-title":"Regret minimization in games with incomplete information","author":"zinkevich","year":"2008","journal-title":"Advances in neural information processing systems"}],"event":{"name":"2018 IEEE Conference on Computational Intelligence and Games (CIG)","start":{"date-parts":[[2018,8,14]]},"location":"Maastricht","end":{"date-parts":[[2018,8,17]]}},"container-title":["2018 IEEE Conference on Computational Intelligence and Games (CIG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8473398\/8490359\/08490415.pdf?arnumber=8490415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T19:27:43Z","timestamp":1643225263000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8490415\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/cig.2018.8490415","relation":{},"subject":[],"published":{"date-parts":[[2018,8]]}}}