This article is a series of anecdotes about the development of several programs that advanced the state of the art in computer chess. The best known is Cray Blitz, which won the 1983 and 1986 World Computer Chess Championships. However, in terms of overall impact, perhaps Crafty is the most important. As a high-performing open-source program, it has been used by countless number of researchers and hobbyists to develop computer chess programs for competitions, research, and for fun.
{"title":"The history of Blitz/Cray-Blitz/Crafty","authors":"R. Hyatt","doi":"10.3233/icg-200167","DOIUrl":"https://doi.org/10.3233/icg-200167","url":null,"abstract":"This article is a series of anecdotes about the development of several programs that advanced the state of the art in computer chess. The best known is Cray Blitz, which won the 1983 and 1986 World Computer Chess Championships. However, in terms of overall impact, perhaps Crafty is the most important. As a high-performing open-source program, it has been used by countless number of researchers and hobbyists to develop computer chess programs for competitions, research, and for fun.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"1 1","pages":"120-131"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83720131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CEN: Thomas Ströhlein's Endgame Tables, a 50th Anniversary","authors":"G.McC. Haworth","doi":"10.3233/icg-200151","DOIUrl":"https://doi.org/10.3233/icg-200151","url":null,"abstract":"","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"1 1","pages":"165-170"},"PeriodicalIF":0.0,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88990446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We are living in confusing and hectic times due to the COVID-19 pandemic. As Editorial Board, we wish that you and your families stay safe and healthy. At the same time, we try to maintain the quality and pace of our publications as you are used to. It is therefore my pleasure to present you the first issue of this year. It contains two scientific articles. The first contribution, A description language for chess , by Manuel Cristóbal López-Michelone and Jorge Ortega-Arjona, presents a straightforward representation language for chess positions as patterns. By using this chess pattern language a computer program is able to find more easily similar chess configurations. Further, this language can be used to explain why some typical maneuvers actually work in some patterns. The second contribution, games for teaching reinforcement learning , by and is using games for educational purposes. They argue that games such as highly suitable for this due to their simplicity and These can be characterized as single-player stochastic puzzle games, which consist of sliding numbered-tiles that combine to form tiles with larger numbers. The article proposes a guideline for using these games for teaching reinforcement-learning and computer-game algorithms.
{"title":"Editorial: Stay the course","authors":"M. Winands","doi":"10.3233/icg-200145","DOIUrl":"https://doi.org/10.3233/icg-200145","url":null,"abstract":"We are living in confusing and hectic times due to the COVID-19 pandemic. As Editorial Board, we wish that you and your families stay safe and healthy. At the same time, we try to maintain the quality and pace of our publications as you are used to. It is therefore my pleasure to present you the first issue of this year. It contains two scientific articles. The first contribution, A description language for chess , by Manuel Cristóbal López-Michelone and Jorge Ortega-Arjona, presents a straightforward representation language for chess positions as patterns. By using this chess pattern language a computer program is able to find more easily similar chess configurations. Further, this language can be used to explain why some typical maneuvers actually work in some patterns. The second contribution, games for teaching reinforcement learning , by and is using games for educational purposes. They argue that games such as highly suitable for this due to their simplicity and These can be characterized as single-player stochastic puzzle games, which consist of sliding numbered-tiles that combine to form tiles with larger numbers. The article proposes a guideline for using these games for teaching reinforcement-learning and computer-game algorithms.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"19 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2020-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85648783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The DouDiZhu tournament of the 2019 Computer Olympiad","authors":"Yuexian Gao","doi":"10.3233/icg-190138","DOIUrl":"https://doi.org/10.3233/icg-190138","url":null,"abstract":"","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"65 1","pages":"60-62"},"PeriodicalIF":0.0,"publicationDate":"2020-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79283338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CEN: Understanding Rook vs Minor Piece Endgames","authors":"G. Haworth","doi":"10.3233/icg-190140","DOIUrl":"https://doi.org/10.3233/icg-190140","url":null,"abstract":"","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"15 1","pages":"41-45"},"PeriodicalIF":0.0,"publicationDate":"2020-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87800781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the last issue of this volume, the ICGA Journal will go back to its roots by presenting several contributions on computer chess. We start by presenting two scientific articles that explore how to deal with draws in chess. The first article, Are Armageddon chess games implemented fairly? by Vladimir Vargas, describes the chess variant Armageddon chess, where in case of a draw Black is declared the winner. To compensate for this, White is given more time. The article presents a method that combines a 2750+ ELO human and engine chess play analysis to estimate the optimal time control so that the expected result of an Armageddon chess game is fair. The second article, Stalemate and ‘DTS’ depth to stalemate endgame tables by Karsten Müller and Guy Haworth, proposes that stalemate is a secondary goal in chess, superior to a draw by agreement or rule – but inferior to mate. The authors report the work of ‘Aloril’ who has created endgame tables holding both depth-to-mate and depth-to-stalemate data.
{"title":"Editorial: Back to the roots","authors":"M. Winands","doi":"10.3233/ICG-190136","DOIUrl":"https://doi.org/10.3233/ICG-190136","url":null,"abstract":"In the last issue of this volume, the ICGA Journal will go back to its roots by presenting several contributions on computer chess. We start by presenting two scientific articles that explore how to deal with draws in chess. The first article, Are Armageddon chess games implemented fairly? by Vladimir Vargas, describes the chess variant Armageddon chess, where in case of a draw Black is declared the winner. To compensate for this, White is given more time. The article presents a method that combines a 2750+ ELO human and engine chess play analysis to estimate the optimal time control so that the expected result of an Armageddon chess game is fair. The second article, Stalemate and ‘DTS’ depth to stalemate endgame tables by Karsten Müller and Guy Haworth, proposes that stalemate is a secondary goal in chess, superior to a draw by agreement or rule – but inferior to mate. The authors report the work of ‘Aloril’ who has created endgame tables holding both depth-to-mate and depth-to-stalemate data.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"22 1","pages":"179"},"PeriodicalIF":0.0,"publicationDate":"2020-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88357627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
WSCC 2019 was ICGA's continuation of its investigation of top chess engines playing at Blitz tempo with the consequential loss of accuracy. It was held in Macau in parallel with the 'WCCC' classical tempo and 'WCSC' neutral-hardware events. The ICGA demonstrated that, even so, the engines play at super-GM level. On this occasion, JONNY proved incisive to win while KOMODO sustained two losses.
{"title":"WSCC 2019: The World Speed Chess Championship","authors":"Jan Krabbenbos, Jaap van den Herik, G. Haworth","doi":"10.3233/icg-190127","DOIUrl":"https://doi.org/10.3233/icg-190127","url":null,"abstract":"WSCC 2019 was ICGA's continuation of its investigation of top chess engines playing at Blitz tempo with the consequential loss of accuracy. It was held in Macau in parallel with the 'WCCC' classical tempo and 'WCSC' neutral-hardware events. The ICGA demonstrated that, even so, the engines play at super-GM level. On this occasion, JONNY proved incisive to win while KOMODO sustained two losses.","PeriodicalId":14829,"journal":{"name":"J. Int. Comput. Games Assoc.","volume":"122 1","pages":"237-240"},"PeriodicalIF":0.0,"publicationDate":"2020-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90785294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：