WCCC 2019: the 25th World Computer Chess Championship

WCCC 2019, the 25th World Computer Chess Championship, continued the ICGA's longitudinal computer chess experiment begun in 1974. This event was held in Macau, featured six chess engines and was won by KOMODO which thereby retained its title of World Champion. CHIRON and SHREDDER were respectively second and third

WCSC 2019: the 9th World Chess Software Championship

The 'WCSC 2019' World Chess Software Championship was the ICGA's ninth experimental test of computer chess software in a neutral hardware environment. Held in Macau, this event was won by KOMODO with JONNY and CHIRON scarcely separable in second and third

WSCC 2019: the World Speed Chess Championship

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

Space-efficient indexing of endgame tables for chess

Chess endgame tables should provide efficiently the value and depth of any required position during play. The indexing of an endgame’s positions is crucial to meeting this objective. This paper updates Heinz’ previous review of approaches to indexing and describes the latest approach by the first and third authors. Heinz’ and Nalimov’s endgame tables (EGTs) encompass the en passant rule and have the most compact index schemes to date. Nalimov’s EGTs, to the Distance-to-Mate (DTM) metric, require only 30.6 × 109 elements in total for all the 3-to-5-man endgames and are individually more compact than previous tables. His new index scheme has proved itself while generating the tables and in the 1999 World Computer Chess Championship where many of the top programs used the new suite of EGTs

KQQKQQ and the Kasparov-World Game

The 1999 Kasparov-World game for the first time enabled anyone to join a team playing against a World Chess Champion via the web. It included a surprise in the opening, complex middle-game strategy and a deep ending. As the game headed for its mysterious finale, the World Team re-quested a KQQKQQ endgame table and was provided with two by the authors. This paper describes their work, compares the methods used, examines the issues raised and summarises the concepts involved for the benefit of future workers in the endgame field. It also notes the contribution of this endgame to chess itself

Space-efficient Indexing of Chess Endgame Tables

Chess endgame tables should provide efficiently the value and depth of any required position during play. The indexing of an endgame’s positions is crucial to meeting this objective. This paper updates Heinz’ previous review of approaches to indexing and describes the latest approach by the first and third authors. Heinz’ and Nalimov’s endgame tables (EGTs) encompass the en passant rule and have the most compact index schemes to date. Nalimov’s EGTs, to the Distance-to-Mate (DTM) metric, require only 30.6 × 10^9 elements in total for all the 3-to-5-man endgames and are individually more compact than previous tables. His new index scheme has proved itself while generating the tables and in the 1999 World Computer Chess Championship where many of the top programs used the new suite of EGTs

Spartan Daily, September 3, 1993

Volume 101, Issue 6https://scholarworks.sjsu.edu/spartandaily/8434/thumbnail.jp

Spartan Daily, October 17, 1972

Volume 60, Issue 18https://scholarworks.sjsu.edu/spartandaily/5653/thumbnail.jp

AI Researchers, Video Games Are Your Friends!

If you are an artificial intelligence researcher, you should look to video games as ideal testbeds for the work you do. If you are a video game developer, you should look to AI for the technology that makes completely new types of games possible. This chapter lays out the case for both of these propositions. It asks the question "what can video games do for AI", and discusses how in particular general video game playing is the ideal testbed for artificial general intelligence research. It then asks the question "what can AI do for video games", and lays out a vision for what video games might look like if we had significantly more advanced AI at our disposal. The chapter is based on my keynote at IJCCI 2015, and is written in an attempt to be accessible to a broad audience.Comment: in Studies in Computational Intelligence Studies in Computational Intelligence, Volume 669 2017. Springe