Game artificial intelligence

artificial intelligence company owned by Google

Minimax (sometimes Minmax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, combinatorial game theory, statistics, and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario. When dealing with gains, it is referred to as "maximin" – to maximize the minimum gain. Originally formulated for several-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of u

computer hardware and software capable of playing chess

algorithm used for pathfinding and graph traversal

Akinator is a video game developed by the French company Elokence. During gameplay, it attempts to determine what fictional or real-life character, object, or animal the player is thinking of by asking a series of questions (similar to the game Twenty Questions). The system learns the best questions to ask through experience from past players. Implementation details are not shared but they fall in the field of statistical classification or expert systems.

Arimaa () is a two-player strategy board game that was designed to be playable with a standard chess set and difficult for computers while still being easy to learn and fun to play for humans. It was invented between 1997 and 2002 by Omar Syed. Arimaa is a complex abstract strategy game and after decades of play, a body of theory has developed among high level players, along with a few books on the game. Arimaa has also developed a community on the internet, where tournaments are played.

simulation of human-like intelligence in video games

search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree

thumb|upright=1.2|Equivalent paths between A and B in a 2D environment

card game

field of artificial intelligence dedicated to creating a computer program that plays Go

field in artificial intelligence research

machine-learned bot project using the video game Dota 2

2024 video game developed by Neal Agarwal

SMA* or Simplified Memory Bounded A* is a shortest path algorithm based on the A* algorithm. The main advantage of SMA* is that it uses a bounded memory, while the A* algorithm might need exponential memory. All other characteristics of SMA* are inherited from A*.

A bitboard is a specialized bit array data structure commonly used in computer systems that play board games, where each bit corresponds to a game board space or piece. This allows parallel bitwise operations to set or query the game state, or determine moves or plays in the game.

function returning estimated value of a position in a game playing program

2002 video game

game that has no sentient players

field of artificial intelligence

computer program designed to play the game of poker

Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game.

heuristic pathfinding algorithm

search algorithm

negamax algorithm

technology developed by Bethesda for The Elder Scrolls video games

use of machine learning in video games

hash function construction used in computer programs that play abstract board games

multi-games event

In computer science, B* (pronounced "B star") is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node (out of one or more possible goals). First published by Hans Berliner in 1979, it is related to the A* search algorithm.

sequence of moves in a game