Related Research Articles
Backgammon is a two-player board game played with counters and dice on tables boards. It is the most widespread Western member of the large family of tables games, whose ancestors date back nearly 5,000 years to the regions of Mesopotamia and Persia. The earliest record of backgammon itself dates to 17th-century England, being descended from the 16th-century game of Irish.
Minmax is a decision rule used in artificial intelligence, decision theory, game theory, statistics, and philosophy for minimizing the possible loss for a worst case 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 uncertainty.
Poker is a family of comparing card games in which players wager over which hand is best according to that specific game's rules. It is played worldwide, but in some places the rules may vary. While the earliest known form of the game was played with just 20 cards, today it is usually played with a standard deck, although in countries where short packs are common, it may be played with 32, 40 or 48 cards. Thus poker games vary in deck configuration, the number of cards in play, the number dealt face up or face down, and the number shared by all players, but all have rules that involve one or more rounds of betting.
Checkers, also known as draughts, is a group of strategy board games for two players which involve forward movements of uniform game pieces and mandatory captures by jumping over opponent pieces. Checkers is developed from alquerque. The term "checkers" derives from the checkered board which the game is played on, whereas "draughts" derives from the verb "to draw" or "to move".
Computer chess includes both hardware and software capable of playing chess. Computer chess provides opportunities for players to practice even in the absence of human opponents, and also provides opportunities for analysis, entertainment and training. Computer chess applications that play at the level of a chess grandmaster or higher are available on hardware from supercomputers to smart phones. Standalone chess-playing machines are also available. Stockfish, Leela Chess Zero, GNU Chess, Fruit, and other free open source applications are available for various platforms.
In the game of poker, the play largely centers on the act of betting, and as such, a protocol has been developed to speed up play, lessen confusion, and increase security while playing. Different games are played using different types of bets, and small variations in etiquette exist between cardrooms, but for the most part the following rules and protocol are observed by the majority of poker players.
Texas hold 'em is one of the most popular variants of the card game of poker. Two cards, known as hole cards, are dealt face down to each player, and then five community cards are dealt face up in three stages. The stages consist of a series of three cards, later an additional single card, and a final card. Each player seeks the best five-card poker hand from any combination of the seven cards: the five community cards and their two hole cards. Players have betting options to check, call, raise, or fold. Rounds of betting take place before the flop is dealt and after each subsequent deal. The player who has the best hand and has not folded by the end of all betting rounds wins all of the money bet for the hand, known as the pot. In certain situations, a "split pot" or "tie" can occur when two players have hands of equivalent value. This is also called "chop the pot". Texas hold 'em is also the H game featured in HORSE and HOSE.
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. It is an adversarial search algorithm used commonly for machine playing of two-player combinatorial games. It stops evaluating a move when at least one possibility has been found that proves the move to be worse than a previously examined move. Such moves need not be evaluated further. When applied to a standard minimax tree, it returns the same move as minimax would, but prunes away branches that cannot possibly influence the final decision.
In the context of combinatorial game theory, which typically studies sequential games with perfect information, a game tree is a graph representing all possible game states within such a game. Such games include well-known ones such as chess, checkers, Go, and tic-tac-toe. This can be used to measure the complexity of a game, as it represents all the possible ways a game can pan out. Due to the large game trees of complex games such as chess, algorithms that are designed to play this class of games will use partial game trees, which makes computation feasible on modern computers. Various methods exist to solve game trees. If a complete game tree can be generated, a deterministic algorithm, such as backward induction or retrograde analysis can be used. Randomized algorithms and minmax algorithms such as MCTS can be used in cases where a complete game tree is not feasible.
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.
Combinatorial game theory measures game complexity in several ways:
- State-space complexity,
- Game tree size,
- Decision complexity,
- Game-tree complexity,
- Computational complexity.
Jonathan Herbert Schaeffer is a Canadian researcher and professor at the University of Alberta and the former Canada Research Chair in Artificial Intelligence.
English draughts or checkers, also called straight checkers or simply draughts, is a form of the strategy board game checkers. It is played on an 8×8 checkerboard with 12 pieces per side. The pieces move and capture diagonally forward, until they reach the opposite end of the board, when they are crowned and can thereafter move and capture both backward and forward.
Badugi is a draw poker variant similar to triple draw, with hand-values similar to lowball. The betting structure and overall play of the game is identical to a standard poker game using blinds, but, unlike traditional poker which involves a minimum of five cards, players' hands contain only four cards at any one time. During each of three drawing rounds, players can trade zero to four cards from their hands for new ones from the deck, in an attempt to form the best badugi hand and win the pot. Badugi is often a gambling game, with the object being to win money in the form of pots. The winner of the pot is the person with the best badugi hand at the conclusion of play. Badugi is played in cardrooms around the world, as well as online, in rooms such as PokerStars. Although it hasn’t had its own tournament per se at the WSOP, it is featured in the Dealers Choice events as well as in the Triple Draw Mix. The 2023 WSOP event does have a Badugi tournament scheduled.
Arthur Lee Samuel was an American pioneer in the field of computer gaming and artificial intelligence. He popularized the term "machine learning" in 1959. The Samuel Checkers-playing Program was among the world's first successful self-learning programs, and as such a very early demonstration of the fundamental concept of artificial intelligence (AI). He was also a senior member in the TeX community who devoted much time giving personal attention to the needs of users and wrote an early TeX manual in 1983.
Anti-computer tactics are methods used by humans to try to beat computer opponents at various games, most typically board games such as chess and Arimaa. They are most associated with competitions against computer AIs that are playing to their utmost to win, rather than AIs merely programmed to be an interesting challenge that can be given intentional weaknesses and quirks by the programmer. Such tactics are most associated with the era when AIs searched a game tree with an evaluation function looking for promising moves, often with Alpha–beta pruning or other minimax algorithms used to narrow the search. Against such algorithms, a common tactic is to play conservatively aiming for a long-term advantage. The theory is that this advantage will manifest slowly enough that the computer is unable to notice in its search, and the computer won't play around the threat correctly. This may result in, for example, a subtle advantage that eventually turns into a winning chess endgame with a passed pawn.
A game is a structured type of play, usually undertaken for entertainment or fun, and sometimes used as an educational tool. Many games are also considered to be work or art.
The following is a glossary of poker terms used in the card game of poker. It supplements the glossary of card game terms. Besides the terms listed here, there are thousands of common and uncommon poker slang terms. This is not intended to be a formal dictionary; precise usage details and multiple closely related senses are omitted here in favor of concise treatment of the basics.
In computer science, Monte Carlo tree search (MCTS) is a heuristic search algorithm for some kinds of decision processes, most notably those employed in software that plays board games. In that context MCTS is used to solve the game tree.
References
- ↑ Chen, Bill and Ankenman, Jerrod. The Mathematics of Poker, p110
- ↑ Online Etymology Dictionary, "ply" (cited 24 April 2011)
- ↑ A.L. Samuel, March 3, 1959: Some Studies in Machine Learning Using the Game of Checkers (cited 25 August 2006)
- ↑ A.L. Samuel, March 3, 1959: Some Studies in Machine Learning Using the Game of Checkers, p. 601 (cited 2 May 2018)
- ↑ Campbell, Murray; Hoane, A.Joseph; Hsu, Feng-Hsiung (2002). "Deep Blue". Artificial Intelligence. 134 (1–2): 57–83. doi:10.1016/S0004-3702(01)00129-1. S2CID 662187.
