{"title":"The 2010 Computer-Stratego World Championship","authors":"I. Satz, Maarten P. D. Schadd","doi":"10.3233/ICG-2011-34119","DOIUrl":"https://doi.org/10.3233/ICG-2011-34119","url":null,"abstract":"","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"34 1","pages":"55-56"},"PeriodicalIF":0.4,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/ICG-2011-34119","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69933462","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}
{"title":"Chess Classics Mainz – End of an Era","authors":"Eric van Reem","doi":"10.3233/ICG-2011-34122","DOIUrl":"https://doi.org/10.3233/ICG-2011-34122","url":null,"abstract":"","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"34 1","pages":"58-59"},"PeriodicalIF":0.4,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/ICG-2011-34122","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69933511","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}
{"title":"The 7th Computers and Games Conference","authors":"Richard J. Lorentz","doi":"10.3233/ICG-2010-33307","DOIUrl":"https://doi.org/10.3233/ICG-2010-33307","url":null,"abstract":"","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"33 1","pages":"153-156"},"PeriodicalIF":0.4,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/ICG-2010-33307","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69933184","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}
The game Connect6, a kind of six-in-a-row game, was first introduced by Wu and Huang (2005) and then described in more detail by Wu, Huang, and Chang (2006). The rules of Connect6 are very simple. Two players, henceforth represented as B (designated as the first player) and W, alternately place two stones, Black and White respectively, on one empty intersection of an 19×19 board, except for that B places one stone initially. The player who first obtains six consecutive stones (horizontally, vertically or diagonally) wins the game. When all intersections on the board are occupied without connecting six, the game draws. In the tournament, the games were played according to a round-robin system in which one program played twice against all the other programs. In each game, every program had to complete all of its moves in 30 minutes. For each game, the winner scored 2 points and the loser scored nothing. For a draw, both scored 1.
{"title":"MORETHANFIVE WINS CONNECT6 TOURNAMENT","authors":"I-Chen Wu, Ping-Hung Lin, Shi-Jim Yen","doi":"10.3233/ICG-2010-33315","DOIUrl":"https://doi.org/10.3233/ICG-2010-33315","url":null,"abstract":"The game Connect6, a kind of six-in-a-row game, was first introduced by Wu and Huang (2005) and then described in more detail by Wu, Huang, and Chang (2006). The rules of Connect6 are very simple. Two players, henceforth represented as B (designated as the first player) and W, alternately place two stones, Black and White respectively, on one empty intersection of an 19×19 board, except for that B places one stone initially. The player who first obtains six consecutive stones (horizontally, vertically or diagonally) wins the game. When all intersections on the board are occupied without connecting six, the game draws. In the tournament, the games were played according to a round-robin system in which one program played twice against all the other programs. In each game, every program had to complete all of its moves in 30 minutes. For each game, the winner scored 2 points and the loser scored nothing. For a draw, both scored 1.","PeriodicalId":50395,"journal":{"name":"Icga Journal","volume":"33 1","pages":"179-180"},"PeriodicalIF":0.4,"publicationDate":"2010-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/ICG-2010-33315","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69932976","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：