{"id":3328,"date":"2021-10-26T02:49:15","date_gmt":"2021-10-26T01:49:15","guid":{"rendered":"https:\/\/icga.org\/?page_id=3328"},"modified":"2024-08-21T23:19:42","modified_gmt":"2024-08-21T22:19:42","slug":"advances-in-computer-games","status":"publish","type":"page","link":"https:\/\/icga.org\/?page_id=3328","title":{"rendered":"2021 Advances in Computer Games"},"content":{"rendered":"\r\n<p class=\"wp-block-paragraph\"><strong>September 6, 2022: The conference is over. The conference proceedings are available from <a href=\"https:\/\/link.springer.com\/book\/10.1007\/978-3-031-11488-5\">Springer<\/a>\u00a0 for free for a few weeks. Individual papers can be found below.<\/strong><\/p>\r\n<p>&nbsp;<\/p>\r\n<p>Welcome to the home page for the <em>Advances in Computer Games<\/em> conference. The first <em>ACG<\/em> conference was held in 1975 (then called <em>Advances in Computer Chess<\/em>). 47 years later, we are still going strong! Since the 1990s, the conference has been organized by the <em>International<\/em> <em>Computer<\/em> <em>Games<\/em> <em>Association<\/em>.<\/p>\r\n\r\n\r\n\r\n<p class=\"wp-block-paragraph\">ACG features cutting edge artificial intelligence technology as applied to computer games. This year&#8217;s conference is being held online November 23-25. <strong>Attendance is free!<\/strong> Join us for an exciting program of superb keynote speakers and exciting research papers.<\/p>\r\n\r\n\r\n\r\n<p class=\"wp-block-paragraph\">Below find information on:<\/p>\r\n\r\n\r\n\r\n<ul class=\"wp-block-list\">\r\n<li>Keynote Speakers<\/li>\r\n<li>Program Committee<\/li>\r\n<li>Accepted Papers<\/li>\r\n<li>Conference Program and Schedule<\/li>\r\n<li>Registering for the conference (it&#8217;s free)<\/li>\r\n<li><em>International Computer Chess Associatio<\/em>n (ICGA)<\/li>\r\n<\/ul>\r\n\r\n\r\n\r\n<h2 class=\"wp-block-heading\"><strong>Keynote Speakers<\/strong><\/h2>\r\n\r\n\r\n\r\n<figure class=\"wp-block-table\">\r\n<table>\r\n<tbody>\r\n<tr>\r\n<td><strong>David Silver<\/strong> leads the\u00a0reinforcement learning\u00a0research group at\u00a0DeepMind\u00a0and was lead researcher on\u00a0<em>AlphaGo<\/em>,\u00a0<em>AlphaZero<\/em>\u00a0and co-lead on\u00a0<em>AlphaStar<\/em>. He graduated from Cambridge University in 1997 and subsequently co-founded the video games company\u00a0Elixir Studios. He returned to academia in 2004 at the\u00a0University of Alberta\u00a0to study for a PhD on reinforcement learning, where he co-introduced the algorithms used in the first master-level 9\u00d79 Go programs. David consulted for\u00a0DeepMind\u00a0from its inception, joining full-time in 2013.\u00a0Silver led the <em>AlphaGo<\/em> project, culminating in the first program to defeat a top professional player in the full-size game of Go. <em>AlphaGo<\/em>\u00a0subsequently received an honorary 9 Dan Professional Certification; and won the Cannes Lion award for innovation. For his breakthrough advances in computer game-playing, David was awarded the 2019 ACM Prize in Computing. In 2021, He was elected Fellow of the Royal Society.<\/td>\r\n<td><img decoding=\"async\" style=\"width: 200px;\" src=\"https:\/\/www.davidsilver.uk\/wp-content\/uploads\/2020\/03\/Dave_Silver_Headshot.jpg\" alt=\"Home - David Silver\" \/><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<\/figure>\r\n\r\n\r\n\r\n<figure class=\"wp-block-table\">\r\n<table>\r\n<tbody>\r\n<tr>\r\n<td><strong>Michael Bowling<\/strong> is a professor in Computing Science, Fellow in the Alberta Machine Intelligence Institute, and a senior scientist in DeepMind. His research is driven by his fascination in the problem of how computers can learn to play games through experience. He led the Computer Poker Research Group, which has built some of the best poker playing programs in the world, including being the first to beat professional players at both limit and no-limit variants of the game. He also was behind the use of Atari 2600 games to evaluate the general competency of reinforcement learning algorithms, which is now a ubiquitous benchmark suite of domains for RL. In 2020, Michael became a Fellow of the Association for the Advancement of Artificial Intelligence.<\/td>\r\n<td><img loading=\"lazy\" decoding=\"async\" width=\"200\" height=\"200\" class=\"wp-image-3331\" style=\"width: 200px;\" src=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/10\/Bowling-Headshot-1-2.jpg\" alt=\"\" srcset=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/10\/Bowling-Headshot-1-2.jpg 600w, https:\/\/icga.org\/wp-content\/uploads\/2021\/10\/Bowling-Headshot-1-2-300x300.jpg 300w, https:\/\/icga.org\/wp-content\/uploads\/2021\/10\/Bowling-Headshot-1-2-150x150.jpg 150w\" sizes=\"auto, (max-width: 200px) 100vw, 200px\" \/><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<\/figure>\r\n\r\n\r\n\r\n<figure class=\"wp-block-table\">\r\n<table>\r\n<tbody>\r\n<tr>\r\n<td><strong>Mark Lefler<\/strong> is an American computer games and chess programmer. He is author of the computer chess program\u00a0<em>Now<\/em>\u00a0and co-author of the\u00a0general game playing\u00a0program\u00a0<em>Zillions of Games<\/em>. Mark founded the\u00a0Chess Programming Wiki\u00a0in 2007, and in 2013 he joined the\u00a0<em>Komodo<\/em>\u00a0computer chess team. Mark graduated in 1981 with a BS degree in Engineering Science and Mechanics from\u00a0Virginia Polytechnic Institute and State University. His non-computer interests include performing magic, music, and gaming. Mark serves as the Programmers Representative of the\u00a0International Computer Games Association (ICGA).<\/td>\r\n<td><img decoding=\"async\" style=\"width: 200px;\" src=\"https:\/\/www.chessprogramming.org\/images\/c\/c0\/Marklefler.jpg\" alt=\"\" \/><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<\/figure>\r\n\r\n\r\n\r\n<figure class=\"wp-block-table\">\r\n<table>\r\n<tbody>\r\n<tr>\r\n<td><strong>Larry Kaufman<\/strong> is an American\u00a0chess\u00a0and\u00a0shogi\u00a0player. In chess, he was awarded the awarded the\u00a0International Master\u00a0title in 1980 and Grandmaster\u00a0title in 2008 (by winning the 2008\u00a0World Seniors Championship). A longtime researcher in\u00a0computer chess, Larry has made several contributions to chess-related works. He helped write the opening book for the pioneering program\u00a0<em>Mac Hack<\/em>, co-developed\u00a0<em>Socrates II\u00a0<\/em>and its commercial adaptation,\u00a0<em>Kasparov&#8217;s Gambit<\/em>, edited the journal\u00a0<em>Computer Chess Reports<\/em>, and worked on many other research and commercial\u00a0chess engines. He is also known for his work on computer chess engine\u00a0<em>Rybka<\/em>\u00a0<em>3 <\/em>and <em>Komodo<\/em>. Larry has been working on computer chess programs since 1967!<\/td>\r\n<td><img decoding=\"async\" style=\"width: 200px;\" src=\"https:\/\/global-uploads.webflow.com\/5f1af76ed86d6771ad48324b\/5f6286658aa227501010ed02_larry-playing-chess-300x300.jpg\" alt=\"MIT Sloan Sports Analytics Conference Speaker | Larry Kaufman\" \/><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<\/figure>\r\n\r\n\r\n\r\n<h2 class=\"wp-block-heading\">Program Committee<\/h2>\r\n\r\n\r\n\r\n<p class=\"wp-block-paragraph\">The conference co-chairs are:<\/p>\r\n\r\n\r\n\r\n<ul class=\"wp-block-list\">\r\n<li>Cameron Browne, Maastricht University, The Netherlands<\/li>\r\n<li>Akihiro Kishimoto, IBM Research, Tokyo, Japan<\/li>\r\n<\/ul>\r\n\r\n\r\n\r\n<p class=\"wp-block-paragraph\">Committee members:<\/p>\r\n\r\n\r\n\r\n<ul class=\"wp-block-list\">\r\n<li>Yngvi Bjornsson, Reykjavik University, Iceland<\/li>\r\n<li>Bruno Bouzy, Paris Descartes University, France<\/li>\r\n<li>Tristan Cazenave, LAMSADE Universit\u00e9 Paris Dauphine PSL CNRS, France<\/li>\r\n<li>Lung-Pin Chen, Tunghai University, Taiwan<\/li>\r\n<li>Siang Yew Chong, School of Computer Science, University of Nottingham, Malaysia<\/li>\r\n<li>Chao Gao, University of Alberta, Canada<\/li>\r\n<li>Reijer Grimbergen, Tokyo University of Technology, Japan<\/li>\r\n<li>Michael Hartisch, University of Siegen, Germany<\/li>\r\n<li>Ryan Hayward, University of Alberta, Canada<\/li>\r\n<li>Chu-Hsuan Hsueh, Japan Advanced Institute of Science and Technology (JAIST), Japan<\/li>\r\n<li>Hiroyuki Iida, Japan Advanced Institute of Science and Technology (JAIST), Japan<\/li>\r\n<li>Eric Jacopin, CREC Saint-Cyr, France<\/li>\r\n<li>Nicolas Jouandeau, Paris8 University, France<\/li>\r\n<li>Tomoyuki Kaneko, University of Tokyo, Japan<\/li>\r\n<li>Jakub Kowalski, University of Wroclaw, Poland<\/li>\r\n<li>Sylvain Lagrue, Universit\u00e9 de Technologie de Compi\u00e8gne (UTC), France<\/li>\r\n<li>Diego Perez Liebana, Queen Mary University of London (QMUL), UK<\/li>\r\n<li>Shun-Shii Lin, National Taiwan Normal University, Taiwan<\/li>\r\n<li>Richard Lorentz, California State University, USA<\/li>\r\n<li>Martin Mueller, University of Alberta, Canada<\/li>\r\n<li>Todd Neller, Gettysburg College, USA<\/li>\r\n<li>Mark Nelson, American University, USA<\/li>\r\n<li>Eric Piette,\u00a0Maastricht University, The Netherlands<\/li>\r\n<li>Mike Preuss, Universiteit Leiden, The Netherlands<\/li>\r\n<li>Abdallah Saffidine, University of New South Wales (UNSW), Australia<\/li>\r\n<li>Spyridon Samothrakis, University of Essex, UK<\/li>\r\n<li>Jonathan Schaeffer, University of Alberta, Canada<\/li>\r\n<li>Dennis Soemers, Maastricht University, The Netherlands<\/li>\r\n<li>Matthew Stephenson, Maastricht University, The Netherlands<\/li>\r\n<li>Nathan Sturtevant, University of Alberta, Canada<\/li>\r\n<li>Ruck Thawonmas, Ritsumeikan University, Germany<\/li>\r\n<li>Michael Thielscher, University of New South Wales (UNSW), Australia<\/li>\r\n<li>Jonathan Vis, Universiteit Leiden, The Netherlands<\/li>\r\n<li>Ting Han Wei, University of Alberta, Canada<\/li>\r\n<li>Mark Winands, Maastricht University, The Netherlands<\/li>\r\n<li>I-Chen Wu, National Yang Ming Chiao Tung University, Taiwan<\/li>\r\n<li>Shi-Jim Yen, National Dong Hwa University, Taiwan<\/li>\r\n<li>Kazuki Yoshizoe, Kyushu University, Japan<\/li>\r\n<\/ul>\r\n\r\n\r\n\r\n<h2 class=\"wp-block-heading\">Accepted Papers<\/h2>\r\n\r\n\r\n\r\n<p class=\"wp-block-paragraph\">22 papers were accepted.<\/p>\r\n\r\n\r\n\r\n<ul class=\"wp-block-list\">\r\n<li>N. Fabiano and T. Cazenave <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_1.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_1.pdf\">Sequential Halving Using Scores<\/a><\/li>\r\n<li>J. Uiterwijk <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_3.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_3.pdf\">Solving Bicoloring-Graph Games on Rectangular Boards &#8212; Part 1: Partisan Col and Snort<\/a><\/li>\r\n<li>J. Uiterwijk <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_4.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_4.pdf\">Solving Bicoloring-Graph Games on Rectangular Boards &#8212; Part 2: Impartial Col and Snort<\/a><\/li>\r\n<li>H.-J. Chang, C. Yueh, G.-Y. Fan, T.-Y. Lin and T.-S. Hsu <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_8.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_8.pdf\">Opponent Model Selection Using Deep Learning<\/a><\/li>\r\n<li>T. Cazenave, J. Sentuc and M. Videau <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_9.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_9.pdf\">Cosine Annealing, Mixnet and Swish Activation for Computer Go<\/a><\/li>\r\n<li>G. Moskowitz and V. Ponomarenko <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_10.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_10.pdf\">A Heuristic Approach to the Game of Sylver Coinage<\/a><\/li>\r\n<li>R. Hayward, M. Jamshidian and R. A. Hearn <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_11.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_11.pdf\">BoxOff is NP-complete<\/a><\/li>\r\n<li>R. Haque, T. H. Wei and M. Mueller <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_13.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_13.pdf\">On the Road to Perfection? Evaluating LeelaChess Zero Against Endgame Tablebases<\/a><\/li>\r\n<li>M. Goadrich and C. Shaddox <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_15.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_15.pdf\">Quantifying the Space of Hearts Variants<\/a><\/li>\r\n<li>L. G. Heredia and T. Cazenave <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_16.pdf\" data-type=\"URL\">Expert Iteration for Risk<\/a><\/li>\r\n<li>S. Tanaka, F. Bonnet, S. Tixeuil and Y. Tamura <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_17.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_17.pdf\">Quixo is solved<\/a><\/li>\r\n<li>B. Doux, B. Negrevergne and T. Cazenave <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_18.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_18.pdf\">Deep Reinforcement Learning for Morpion Solitaire<\/a><\/li>\r\n<li>M. Stephenson, E. Piette, D. J. N. J. Soemers and C. Browne <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_20.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_20.pdf\">Automatic Generation of Board Game Manuals<\/a><\/li>\r\n<li>G. Guglielmo, I. Peradajordi and M. Klincewicz <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_21.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_21.pdf\">Using Deep Learning to Detect Facial Markers of Complex Decision Making<\/a><\/li>\r\n<li>C. Yi and T. Kaneko <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_22.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_22.pdf\">Improving Counterfactual Regret Minimization Agents Training in card game Cheat Using Ordered Abstraction<\/a><\/li>\r\n<li>D. J. N. J. Soemers, E. Piette, M. Stephenson and C. Browne <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_24.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_24.pdf\">Optimised Playout Implementations for the Ludii General Game System<\/a><\/li>\r\n<li>K. Fujihira, C.-H. Hsueh and K. Ikeda <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_27.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_27.pdf\">Procedural Maze Generation with Considering Difficulty from Human Players&#8217; Perspectives<\/a><\/li>\r\n<li>A. P\u00e1lsson and Y. Bjornsson <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_29.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_29.pdf\">Evaluating Interpretability Methods for DNNs in Game-Playing Agents<\/a><\/li>\r\n<li>M. Bizjak and M. Guid <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_30.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_30.pdf\">Automatic Recognition of Similar Chess Motifs<\/a><\/li>\r\n<li>A. Gunes, F. Kavum and S. Sariel <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_31.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_31.pdf\">A Generic Approach for Player Modelling Using Event-Trait Mapping Supported by PCA<\/a><\/li>\r\n<li>C. Browne, E. Piette, M. Stephenson and D. Soemers <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_32.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_32.pdf\">General Board Geometry<\/a><\/li>\r\n<li>D. Gomboc and C. Shelton <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_34.pdf\" target=\"_blank\" rel=\"noreferrer noopener\" data-type=\"URL\" data-id=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG_2021_paper_34.pdf\">Chess endgame compression via logic minimization<\/a><\/li>\r\n<\/ul>\r\n\r\n\r\n\r\n<h2 class=\"wp-block-heading\">Conference Program and Schedule<\/h2>\r\n\r\n\r\n\r\n<p class=\"wp-block-paragraph\">November 23-25. Click <a href=\"https:\/\/icga.org\/wp-content\/uploads\/2021\/11\/ACG2021_Schedule-7.pdf\">here<\/a> for the detailed schedule.<\/p>\r\n\r\n\r\n\r\n<h2 class=\"wp-block-heading\">Conference Talk Video<\/h2>\r\n\r\n\r\n\r\n<ul class=\"wp-block-list\">\r\n<li><a href=\"https:\/\/ualberta.aviaryplatform.com\/playlists\/298\/show\/playlist_resource_id\/8376\/collection_resource_file_id\/175454\">Conference talks<\/a><\/li>\r\n<\/ul>\r\n\r\n\r\n\r\n<h2 class=\"wp-block-heading\">Registering for the Conference<\/h2>\r\n\r\n\r\n\r\n<p class=\"wp-block-paragraph\">Conference attendee registration is free. A few days before the conference you will receive a video link which will allow you to watch and interact with the live presentations.<\/p>\r\n\r\n\r\n\r\n<p class=\"wp-block-paragraph\">Please register\u00a0<a href=\"https:\/\/docs.google.com\/forms\/d\/1TCEmXno8QXUPhgkBXhTipsxAninuzfE_HLsb0Rt9j18\">here<\/a>.<\/p>\r\n\r\n\r\n\r\n<h2 class=\"wp-block-heading\">International Computer Games Association (ICGA)<\/h2>\r\n\r\n\r\n\r\n<p class=\"wp-block-paragraph\">Interested in AI and games? Join the ICGA! The benefits of membership include:<\/p>\r\n\r\n\r\n\r\n<ul class=\"wp-block-list\">\r\n<li>receiving\u00a0the quarterly\u00a0<em>ICGA Journal<\/em>\u00a0(electronically or in print);<\/li>\r\n<li>enter the World Computer Chess Championships;<\/li>\r\n<li>enter the Computer Olympiad;<\/li>\r\n<li>contribute to and\/or participate in the annual\u00a0<em>Computers and Games<\/em> and\u00a0<em>Advances in Computer Games<\/em>\u00a0conferences; and<\/li>\r\n<li>join an international community of researchers\/companies\/hobbyists who have a passion for applying to AI to games.<\/li>\r\n<\/ul>\r\n\r\n\r\n\r\n<p class=\"wp-block-paragraph\">For more information, please go <a href=\"https:\/\/icga.org\/?page_id=3093\">here<\/a>.<\/p>\r\n","protected":false},"excerpt":{"rendered":"<p>September 6, 2022: The conference is over. The conference proceedings are available from Springer\u00a0 for free for a few weeks. Individual papers can be found below. &nbsp; Welcome to the home page for the Advances in Computer Games conference. The &hellip; <a href=\"https:\/\/icga.org\/?page_id=3328\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":18,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-3328","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/icga.org\/index.php?rest_route=\/wp\/v2\/pages\/3328","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/icga.org\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/icga.org\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/icga.org\/index.php?rest_route=\/wp\/v2\/users\/18"}],"replies":[{"embeddable":true,"href":"https:\/\/icga.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=3328"}],"version-history":[{"count":33,"href":"https:\/\/icga.org\/index.php?rest_route=\/wp\/v2\/pages\/3328\/revisions"}],"predecessor-version":[{"id":3949,"href":"https:\/\/icga.org\/index.php?rest_route=\/wp\/v2\/pages\/3328\/revisions\/3949"}],"wp:attachment":[{"href":"https:\/\/icga.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=3328"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}