General game playing

General game playing was also proposed for trading agents in supply chain management there under price negotiation in online auctions from 2003 on.

It also employed usual algorithms as found in computer chess systems: alpha–beta pruning with move ordering, transposition tables, etc.

[21] The package was extended in 2007 by the addition of the Axiom plug-in, an alternate metagame engine that incorporates a complete Forth-based programming language.

z-Tree allows the definition of game rules in z-Tree-language for game-theoretic experiments with human subjects.

In the first stage of the competition, entrants are judged on their ability to perform legal moves, gain the upper hand, and complete games faster.

It has offered a way for researchers and practitioners to test and compare their best general video game playing algorithms.

The competition has an associated software framework including a large number of games written in the Video Game Description Language (VGDL), which should not be confused with GDL and is a coding language using simple semantics and commands that can easily be parsed.

[clarification needed] VGDL can be used to describe a game specifically for procedural generation of levels, using Answer Set Programming (ASP) and an Evolutionary Algorithm (EA).

[45] A popular method for developing GGP AI is the Monte Carlo tree search (MCTS) algorithm.

[47][48][49] Another variation of tree-search algorithms used is the Directed Breadth-first Search (DBS),[50] in which a child node to the current state is created for each available action, and visits each child ordered by highest average reward, until either the game ends or runs out of time.

[51] In each tree-search method, the AI simulates potential actions and ranks each based on the average highest reward of each path, in terms of points earned.