发布求助
文献互助 智能选刊 最新文献

Icga Journal最新文献

筛选
英文 中文
Reach Chess: An accidental chess variant 到达国际象棋意外的国际象棋变体
IF 0.4 4区 计算机科学
Icga Journal Pub Date : 2024-09-10 DOI: 10.3233/icg-240253
Cameron Browne, Markus Niebisch, Alain Brobecker, Stephen Tavener
{"title":"Reach Chess: An accidental chess variant","authors":"Cameron Browne, Markus Niebisch, Alain Brobecker, Stephen Tavener","doi":"10.3233/icg-240253","DOIUrl":"https://doi.org/10.3233/icg-240253","url":null,"abstract":"Reach Chess is a chess variant discovered by accident while testing the Ludii general game system, in which a simple rule change fundamentally subverts the nature of the standard game. This paper describes Reach Chess, how it came to exist, and reveals its character through a brief analysis and puzzle with annotated solution.","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"39 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142194668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
GameTable Working Group 1 meeting report on search, planning, learning, and explainability 关于搜索、规划、学习和可解释性的 GameTable 第 1 工作组会议报告
IF 0.4 4区 计算机科学
Icga Journal Pub Date : 2024-07-29 DOI: 10.3233/icg-240251
Dennis J.N.J. Soemers, Jakub Kowalski, Éric Piette, Achille Morenville, Walter Crist
{"title":"GameTable Working Group 1 meeting report on search, planning, learning, and explainability","authors":"Dennis J.N.J. Soemers, Jakub Kowalski, Éric Piette, Achille Morenville, Walter Crist","doi":"10.3233/icg-240251","DOIUrl":"https://doi.org/10.3233/icg-240251","url":null,"abstract":"The inaugural in-person meeting for the “GameTable” COST Action’s Working Group 1 (WG1) on Search, Planning, Learning, and Explainability took place at the Leiden Institute of Advanced Computer Science (LIACS) on January 31st, 2024. The primary aims of this meeting were to facilitate talks and discussions on, and connect researchers interested in, three core research goals: (1) human-like game-playing AI, (2) imperfect-information games within a general game playing context, and (3) explainable search and reinforcement learning in games. This report provides a summary of the discussions and talks that took place during the meeting.","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"48 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141871971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Los Alamos chess game 2 (after P-K3) is solved; black wins in 21 moves 洛斯阿拉莫斯国际象棋第 2 局（P-K3 之后）已解；黑棋 21 步获胜
IF 0.4 4区 计算机科学
Icga Journal Pub Date : 2024-05-30 DOI: 10.3233/icg-240247
Roger Sayle
{"title":"Los Alamos chess game 2 (after P-K3) is solved; black wins in 21 moves","authors":"Roger Sayle","doi":"10.3233/icg-240247","DOIUrl":"https://doi.org/10.3233/icg-240247","url":null,"abstract":"In a defining event for the field of Artificial Intelligence (AI), the first game of chess skill between a human and computer took place in 1956 (Chess Review (1957) 13–17; The Machine Plays Chess? (1978) Pergamon Press). In this match, Dr Martin Kruskal from Princeton University played White against the MANIAC I computer at Los Alamos Scientific Laboratory in New Mexico, programmed by Paul Stein and Mark Wells. Due to the very limited capacity of computers at the time, which couldn’t handle a full 8×8 chess board, the competitors played “Los Alamos Chess”, a minichess variant using a 6×6 board without bishops. For this game, White played without a queen, opened with P-K3 and ultimately won against the machine opponent in 38 moves. Here we show that Black can force a win in 21 moves.","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"36 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141198469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
GameTable COST action: kickoff report GameTable COST 行动：开球报告
IF 0.4 4区 计算机科学
Icga Journal Pub Date : 2024-04-12 DOI: 10.3233/icg-240245
Éric Piette, Walter Crist, Dennis J.N.J. Soemers, Lisa Rougetet, Summer Courts, Tim Penn, Achille Morenville
{"title":"GameTable COST action: kickoff report","authors":"Éric Piette, Walter Crist, Dennis J.N.J. Soemers, Lisa Rougetet, Summer Courts, Tim Penn, Achille Morenville","doi":"10.3233/icg-240245","DOIUrl":"https://doi.org/10.3233/icg-240245","url":null,"abstract":"The GameTable COST Action kickoff, focusing on “Computational Techniques for Tabletop Games Heritage,” took place at Leiden University in the Pieter de la Court Building from January 29th to 30th, 2024. This event aimed to convene researchers from diverse backgrounds involved in the Action, offering an opportunity to present an overview of the key research areas, share concrete case studies, and facilitate discussions and idea exchanges across fields that may not typically intersect, thereby enhancing the organization of the Action. This report provides a summary of the organization and discussions of the event, and future plans for GameTable.","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"36 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140595106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
2024 world computer chess championships: The end of an era 1974–2024 2024 年世界计算机国际象棋锦标赛：一个时代的终结 1974-2024
IF 0.4 4区 计算机科学
Icga Journal Pub Date : 2024-04-02 DOI: 10.3233/icg-240243
Jonathan Schaeffer
{"title":"2024 world computer chess championships: The end of an era 1974–2024","authors":"Jonathan Schaeffer","doi":"10.3233/icg-240243","DOIUrl":"https://doi.org/10.3233/icg-240243","url":null,"abstract":"After 50 years, the final World Computer Chess Championships will be held in Santiago de Compostela, Spain, October 19–24, 2024. Most of the world’s strongest programs will be competing for the coveted Shannon Trophy. In addition to the tournaments, there will be a very special event: the Chess: History, Experiments, and Search Symposium (CHESS), which will bring together many of the pioneers of computer chess.","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"18 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140595105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Athénan wins sixteen gold medals at the Computer Olympiad 阿瑟南在计算机奥林匹克竞赛中赢得 16 枚金牌
IF 0.4 4区 计算机科学
Icga Journal Pub Date : 2024-01-02 DOI: 10.3233/icg-230239
Quentin Cohen-Solal, Tristan Cazenave
{"title":"Athénan wins sixteen gold medals at the Computer Olympiad","authors":"Quentin Cohen-Solal, Tristan Cazenave","doi":"10.3233/icg-230239","DOIUrl":"https://doi.org/10.3233/icg-230239","url":null,"abstract":"Unlike Alpha Zero-like algorithms (Silver et al., 2018), Athénan is based on the Descent framework (Cohen-Solal, 2020). Thus, during the training process, it uses a variant of Unbounded Minimax (Korf and Chickering, 1996) called Descent, instead of Monte Carlo Tree Search, to construct the partial game tree used to determine the best action to play and to collect data for learning. With Descent, at each move, the best sequences of moves are iteratively extended until terminal states. During evaluations, another variant of Unbounded Minimax is used. This variant contains in particular a generic solver and it chooses the safest action to decide between actions. Moreover, contrary to Alpha Zero, Athénan does not use a policy network, only a value network. The actions therefore do not need to be encoded. In addition, unlike the Alpha Zero paradigm, with Athénan all data generated during the searches to determine the best actions to play is used for learning. As a result, much more data is generated per match (Cohen-Solal and Cazenave, 2023), and thus the training is done more quickly and does not require a (massive) parallelization to give good results (contrary to Alpha Zero). Athénan can use end-of-game heuristic evaluations to improve its level of play, such as game score or game length (in order to win quickly and lose slowly). Further improvements are described in (Cohen-Solal, 2020).","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"18 7","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139452099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The 2023 Computer Olympiad 2023 年计算机奥林匹克竞赛
IF 0.4 4区 计算机科学
Icga Journal Pub Date : 2024-01-02 DOI: 10.3233/icg-230240
Hiroyuki Iida, Jonathan Schaeffer, I-Chen Wu
{"title":"The 2023 Computer Olympiad","authors":"Hiroyuki Iida, Jonathan Schaeffer, I-Chen Wu","doi":"10.3233/icg-230240","DOIUrl":"https://doi.org/10.3233/icg-230240","url":null,"abstract":"The 26th Computer Olympiad was held online during August/September 2023. With 102 participating programs competing in 32 events, the event was a success.","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"92 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139083986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Editorial: Looking back, looking forward 社论：回顾过去，展望未来
IF 0.4 4区 计算机科学
Icga Journal Pub Date : 2024-01-02 DOI: 10.3233/icg-230241
Mark Winands
{"title":"Editorial: Looking back, looking forward","authors":"Mark Winands","doi":"10.3233/icg-230241","DOIUrl":"https://doi.org/10.3233/icg-230241","url":null,"abstract":"","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"73 8","pages":""},"PeriodicalIF":0.4,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139452583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MeowCaTS won the Mahjong tournament MeowCaTS 赢得麻将锦标赛
IF 0.4 4区 计算机科学
Icga Journal Pub Date : 2023-12-21 DOI: 10.3233/icg-230238
Shih-Chieh Tang, I-Chen Wu, Jr-Chang Chen
{"title":"MeowCaTS won the Mahjong tournament","authors":"Shih-Chieh Tang, I-Chen Wu, Jr-Chang Chen","doi":"10.3233/icg-230238","DOIUrl":"https://doi.org/10.3233/icg-230238","url":null,"abstract":"","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"51 11","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138948535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Artificial intelligence and correspondence chess: A harbinger for other endeavors 人工智能与国际象棋：其他工作的先兆
IF 0.4 4区 计算机科学
Icga Journal Pub Date : 2023-12-12 DOI: 10.3233/icg-230237
Jon Edwards
{"title":"Artificial intelligence and correspondence chess: A harbinger for other endeavors","authors":"Jon Edwards","doi":"10.3233/icg-230237","DOIUrl":"https://doi.org/10.3233/icg-230237","url":null,"abstract":"","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"14 25","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138977143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信