Tile-matching video game Tile-matching video game A tile-matching video game is a type of puzzle video game where the player manipulates tiles in order to make them disappear according to a matching criterion. In many tile-matching games, that criterion is to place a given number of tiles of the same type so that they adjoin each other. That number is often three, and these games are called match-three games. The core challenge of tile-matching games is the identification of patterns on a seemingly chaotic board. Their origins lie in late 1980s games such as "Tetris", "Chain Shot!" ("SameGame") and "Puzznic". Tile-matching games were
Maven (Scrabble) on Scrabble. The problem with Alpha Beta is that some Scrabble endgames require 14 moves to play out, and it is not possible to search that deeply. This is not merely a theoretical possibility. When one player is "stuck" with a tile, then playing out all remaining tiles is impossible. In that situation the optimal strategy for both sides is usually to play one tile on each turn. Maven uses a different approach. The B* search algorithm is a selective-depth, progressive-widening algorithm that guarantees to find optimal solutions to two-player games when one can compute upper and lower bounds on