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
Tile-based video game store metadata about the tiles, such as collision, damage, and entities, either with a 2-dimensional array mapping the tiles, or a second texture atlas mirroring the visual one but coding metadata by colour. This approach allows for simple, visual map data, letting level designers create entire worlds with a tile reference sheet and perhaps a text editor, a paint program, or a simple level editor (many older games included the editor in the game). Examples of tile-based game engine/IDEs include RPG Maker, , Construct, Godot, and Tiled. Variations include level data using "material tiles" that are procedurally transformed into the