The game of chess involves patterns. In this article we develop a simple description language for chess positions as patterns. It seems useful to catalogue similar positions in a generic form, based on common elements, in order to simplify the search for chess positions. A simple chess pattern language is used here to develop a computer program to find similar chess configurations. The aim is to avoid

2048-like games are a family of single-player stochastic puzzle games, which consist of sliding numbered-tiles that combine to form tiles with larger numbers. Notable examples of games in this family include Threes!, 2048, and 2584. 2048-like games are highly suitable for educational purposes due to their simplicity and popularity. Numerous machine learning methods have been proposed to play 2048-like

A strategy to find fair time controls for Armageddon chess games is presented and exemplified with 2750+ ELO players. The research was divided in two stages. The first one consisted in finding a time control for Stockfish 9 so that it played with an effective strength equal to the average 2750+ ELOplayers of the 2017 World Blitz Chess Championship. Analysis of this stage showed that a fair time control

Stalemating the opponent in chess has given rise to various opinions as to the nature of that result and the reward it should properly receive. Here, following Lasker and Reti, we propose that ‘stalemate’ is a secondary goal, superior to a draw by agreement or rule – but inferior to mate. We reportthe work of ‘Aloril’ who has created endgame tables holding both ‘DTM’ depth to mate and ‘DTS’ depth to