Search

In the game of chess the notion of beginner has three meanings. In this contribution they are used as a framework for the history of computer chess. The natural line of reasoning will then bring us to main question: Will the game of Chess (soon) be Solved? A positive answer will certainly be seen as a stepping stone for the next question: Can a computer play perfect chess? Of course, this question will have a natural follow-up in the form of an even more challenging question: Is perfect thinking by a computer possible? The audacious answer "yes" will lead to the world-wide prevailing question of all current AI scientists: Will our intelligence be replaced by AI? The article finds its way (not discussed by us) via machine learning and autonomous adaptation to deep learning and thereafter via Explainable AI and Interpretable AI to solving the Game of Chess. Cornerstones of this historical development will be given in the next three articles by Richard Pijl, Dap Hartmann and Jon Edwards. [ABSTRACT FROM AUTHOR]

From 2015 to 2022 he co-authored 28 tournament reports and (review) articles on computer chess, such as the ICGA World Computer Chess Championships, and the International CSVN tournaments (see Krabbenbos (et al.) [1]; [3]; [7]; [2]; [4]-c). Chief arbiter of the Computer Chess World Championships Jan and Grace were also in Pamplona in 2009, at the 14 SP th sp Computer Olympiad. Grace supported Johanna and Jan was skilled in arbitrating computer chess disputes during the World Championship Tournament. All of a sudden, Grace was there At some point it dawned on us Jan not only loves computer chess, he also loves Grace. [Extracted from the article]

The article offers information on the 16th Advances in Computer Games conference (ACG 2019) which was held in Macau, China during August 11–13, 2019, in conjunction with the International Joint Conference on Artificial Intelligence (IJCAI) conference, World Computer-Chess Championship. Topics include investigate the initial inspiration process and design process with optimized versions of the game Cluster; and generate puzzles so that human players improve at playing the game of Tetris.

The article offers information on the ninth World Chess Software Championship (WCSC) started on August 11, 2019. Topics include, six programs participated in a double round robin tournament of ten rounds; tournament took place at the Venetian Macau Hotel Resort in Macau, China and was organized by the International Joint Conference on Artificial Intelligence (IJCAI-19) who was also main sponsor; and winning combination in the tournament.

The article offers information on the 25th World Computer Chess Championship (WCCC) started on August 13, 2019. Topics include, six programs participated in a double round robin tournament of ten rounds; the venue was part of the 28th International Joint Conference on Artificial Intelligence (IJCAI-19) who acted also as the main sponsor; and every chess player understands that White is the winning side.

The article offers information on the WSCC 2019 (World Speed Chess Championship) which was held on the 12th and 15th August, 2019 at the Venetian Macau Hotel Resort in Macau, China. Topics include, chess event was part of the 28th International Joint Conference on Artificial Intelligence (IJCAI-19) which also acted as the main sponsor; other important sponsor was Digital Game Technology (DGT) who provided the electronic chessboards; and winning of Johannes Zwanzger.

The article focuses on the 8th World Chess Software Championship (WCSC) 2018 which was held on July 14th-15th at the Stockholmsmässan in Stockholm. The championship was organised by International Computer Games Association (ICGA) and sponsored by Digital Game Technology (DGT). The computer chess software tournament was played between nine chess engines using the computer software in nine different rounds. The commentary on the tournament was made by International Grand Master Harry Schussler.

The article focuses on the World Speed Computer Chess Championship (WSCC) 2018 which was held on July 13th at the Stockholmsmässan in Stockholm. The championship was organised by International Computer Games Association (ICGA) and sponsored by Digital Game Technology (DGT). The computer chess tournament was played between five outs of eight chess players using the WCCC hardware in five different rounds. The numbers of games per round and rules was discussed during the player meeting.

The article focuses on the 24th World Computer Chess Championship (WCCC) 2018 which was held on July 16 at the Stockholmsmässan in Stockholm. The championship was organised by International Computer Games Association (ICGA) and sponsored by Digital Game Technology (DGT). The computer chess tournament was played between eight programs using the computer software in eight different rounds. The commentary on the tournament was made by chess grandmasters Vlastimil Hort and Harry Schussler.

The article discusses the World Chess Software Championship that was held at Leiden University in Leiden, Netherlands on July 1, 2017. Information about the match between chess players, tactics when playing and moves to win in the tournament, is highlighted. An overview on the officiating of the game as well as scoring, is also provided.

The International Computer Games Association Journal published an article titled "The future of chess." The article discusses the connection between Correspondence Chess and Computer Chess, which were brought together at the ICCF Congress 2023 in Amsterdam. The congress focused on honoring the new Correspondence Chess World Champion, Jon Edwards, and discussing the future of chess. Keynote speakers addressed topics such as the development of computers, the playing strength at the World Computer Chess Championship, and the connection between Computer Chess and Correspondence Chess. The article also raises the question of whether it is possible to solve the game of chess. [Extracted from the article]

The article discussses the 23rd World Computer Chess Championship tournament at Leiden University in the Netherlands on July 3, 2017. Organizers of the event include the International Computer Games Association (ICGA), the Leiden Institute of Advanced Computer Science (LIACS), and the Lieden Centre of Data Science (LCDS). An overview of the performance of the participating programs from authors by Johannes Zwanzger, Don Dailey and Stefan Meyer-Kahlen is also presented.

The article highlights the 6th World Chess Software Championship at the Leiden University in the Netherlands on July 2, 2016. Topics mentioned include the event organizers, such as the International Computer Games Association and the Leiden Centre of Data Science, the game's contestants, including Mark Lefler, Stefan Meyer-Kahlen, and Richard Pijl, the victory of the Komodo program by Don Dailey, Larry Kaufman and Lefler, as well as the performance of all programs in various rounds of the game.

The article discusses the 22nd World Computer Chess Championship, held at the Leiden University in Leiden, Netherlands on June 27, 2016. It highlights the understanding between the human and computer in playing chess computer games. It also cites the exchange of bishop between the black and the white in chess games.

The article highlights the 2016 World Speed Computer Chess Championship (WSCC) of the International Computer Games Association (ICGA). Topics mentioned include the nature of the game which pertains to the merits of good static evaluation by the engines and the reliability and hand speed from the operators, progress of the game round by round, and the availability of the game online.

Using crowdsourcing for solving disputes is a subject that has not been discussed in many scientific publications. However, since Crowdsourced Online Dispute Resolution (CODR) provides a cheap, fast, and democratic dispute resolution, it has a potential that needs to be explored scientifically. How should eBay solve otherwise 60 millions disputes per year? Building a CODR platform with the convenience and attractiveness of other collective intelligence systems, such as Wikipedia, YouTube, and Google, may cause many variants of traditional forms of dispute resolution fading away. In order to shed more light on CODR, the present contribution defines this new type of dispute resolution, describes the present state of play, and builds a theoretical framework by investigating CODR building blocks. Although the paper provides only the start of a profound discussion, it shows introductory explorations of the key theoretical issues involved in CODR. [ABSTRACT FROM AUTHOR]

Provides information on the Belgian Dutch Artificial Intelligence Association. Brief information on the foundation of the organization; Rationale on the establishment of the association; Contributions of the association in the field of artificial intelligence.

Comments on the three main requirements for models of vision associated with the theory of representation by similarities. Translation and scale variance of human recognition; Scalability; Sequential and hierarchical nature of visual processing.

Traditionally, the analysis of visual arts is performed by human art experts only. The availability of advanced artificial intelligence techniques makes it possible to support art experts in their judgement of visual art. In this article currently available image-analysis techniques are applied. Our aim is (1) to determine how successful the usage of complementary colours was in the oeuvre of Vincent Van Gogh and (2) whether this characteristic may make his paintings identifiable in time. It is commonly acknowledged that, especially in his French period, Van Gogh started employing complementary colours to emphasize contours of objects or parts of scenes. This article proposes a new method called MECOCO [1] MECOCO stands for Method for the Extraction of COmplementary COlours. 1 to measure complementary-colour usage in a painting by combining an opponent-colour space representation with Gabor filtering. To achieve the aim, (1) we defined a novel measure called the opponency value that quantifies the usage of complementary-colour transitions in a painting and (2) we studied Van Gogh’s painting style. MECOCO’s analysis of a dataset of 145 digitised and colour-calibrated oil-on-canvas paintings confirms the global transition pattern of complementary colours in Van Gogh’s paintings as generally acknowledged by art experts. In addition, MECOCO also provides an objective and quantifiable way to support the analysis of colours in individual paintings. [Copyright &y& Elsevier]

The visual detection and recognition of objects is facilitated by context. This paper studies two types of learning methods for realizing context-based object detection in paintings. The first method is called the gradient method; it learns to transform the spatial context into a gradient towards the object. The second method, the context-detection method, learns to detect image regions that are likely to contain objects. The accuracy and speed of both methods are evaluated on a face-detection task involving natural and painted faces in a wide variety of contexts. The experimental results show that the gradient method enhances accuracy at the cost of computational speed, whereas the context-detection method optimises speed at the cost of accuracy. The different results of both methods are argued to arise from the different ways in which the methods trade-off accuracy and speed. We conclude that both the gradient method and the context-detection method can be applied to reliable and fast object detection in paintings and that the choice for either method depends on the application and user constraints. [Copyright &y& Elsevier]

Microscopic analysis is a standard approach in the study of robot behaviour. Typically, the approach comprises the analysis of a single (or sometimes a few) robot-environment system(s) to reveal specific properties of robot behaviour. In contrast to microscopic analysis, macroscopic analysis focuses on averaged properties of systems. The advantage is that such a property is easier to generalize so that it can be established to what extent the property is universal. This paper investigates whether a macroscopic analysis can reveal a universal property of adaptive behaviour in a robot model of foraging behaviour. Our analysis reveals that the step lengths of the most successful robots are distributed according to a Lévy-flight distribution. From studies on a variety of natural species, it is known that such a distribution constitutes a universal property of foraging behaviour. Thereafter, we discuss an example of how macroscopic analysis can be applied to existing research in evolutionary robotics, and relate the macroscopic and microscopic analyses of foraging behaviour to the framework of scientific research described by Cohen (1995, Empirical Methods for Artificial Intelligence (Cambridge MA: MIT Press)). We conclude that macroscopic analysis may predict universal properties of adaptive behaviour and that it may complement microscopic analysis in the study of adaptive behaviour. [ABSTRACT FROM AUTHOR]

Reactive agents are generally believed to be incapable of coping with perceptual ambiguity (i.e., identical sensory states that require different responses). However, a recent finding suggests that reactive agents can cope with perceptual ambiguity in a simple model (Nolfi, 2002). This paper investigates to what extent reactive and nonreactive agents can cope with perception ambiguity, and which strategies are employed when doing so. A model of active categorical perception (called Acp) is introduced. In Acp, situated agents with different types of neurocontrollers are optimized to categorize objects by adaptively coordinating action and perception. Our experiments show that both nonreactive and reactive agents can cope with perceptual ambiguity. An analysis of the behavior reveals that nonreactive agents use their internal memory to cope with perceptual ambiguity, while reactive agents use the environment as an external memory to compensate for their lack of internal memory. We conclude that reactive agents can cope with perceptual ambiguity in the context of active categorical perception, and that they can organize their behavior according to stimuli that are no longer present, especially when they incorporate a nonlinear sensorimotor mapping. Moreover, we may conclude that sensory state-transition diagrams provide insight into the strategies employed by reactive agents to deal with perceptual ambiguity, and their use of the environment as an external memory. [ABSTRACT FROM AUTHOR]