game algorithm

См. также в других словарях:

• Game theory — is a branch of applied mathematics that is used in the social sciences (most notably economics), biology, engineering, political science, computer science (mainly for artificial intelligence), and philosophy. Game theory attempts to… …   Wikipedia

• Game artificial intelligence — refers to techniques used in computer and video games to produce the illusion of intelligence in the behavior of non player characters (NPCs). The techniques used typically draw upon existing methods from the academic field of artificial… …   Wikipedia

• Game semantics — (German: dialogische Logik) is an approach to formal semantics that grounds the concepts of truth or validity on game theoretic concepts, such as the existence of a winning strategy for a player, somewhat resembling Socratic dialogues or medieval …   Wikipedia

• Game Description Language — Game Description Language, or GDL, is a language designed by Michael Genesereth as part of the General Game Playing Project at Stanford University, California. GDL describes the state of a game as a series of facts, and the game mechanics as… …   Wikipedia

• Game tree — If you re looking for game tree as it s used in game theory (not combinatorial game theory), please see Extensive form game. In game theory, a game tree is a directed graph whose nodes are positions in a game and whose edges are moves. The… …   Wikipedia

• Music video game — Open source music video game StepMania A music video game, also commonly known as a music game, is a video game where the gameplay is meaningfully and often almost entirely oriented around the player s interactions with a musical score or… …   Wikipedia

• Mastermind (board game) — For other uses, see Mastermind (disambiguation). Mastermind (board game) A game of Mastermind completed. Players 2 Age range 8 and up Setup time < 5 minutes …   Wikipedia

• Solved game — A two player game can be solved on several levels: [V. Allis, Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Department of ComputerScience, University of Limburg, 1994. Online:… …   Wikipedia

• Christopher Baek's Algorithm — Contents 1 Origin and purpose 2 Applications 3 Notes 4 Examples 5 External links …   Wikipedia

• Greedy algorithm — A greedy algorithm is any algorithm that follows the problem solving metaheuristic of making the locally optimum choice at each stage Paul E. Black, greedy algorithm in Dictionary of Algorithms and Data Structures [online] , U.S. National… …   Wikipedia

• Selection algorithm — In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic). This includes the cases of finding the minimum, maximum, and median elements. There are… …   Wikipedia