Please enable JavaScript to use CodeHS

Python Glossary

Flashcards

Course:

Module:

Lesson:

Search:

Minimax General

A decision method designed to minimize potential losses and maximize potential gains for a given player

Minimizing General

In minimax, minimizing refers to an opponent who is looking for their optimal move.

Maximizing General

In minimax, maximizing refers to a player who is looking for their own optimal move.

Finite State Machine (FSM) General

An artificial intelligence model that is commonly used in games to model the behavior of a non-playable character (NPC). It consists of a set of finite states with associated transitions that occur based on certain events, which cause the character between different behaviors.

Non-Playable Character (NPC) General

A character in a game that is controlled by an artificial intelligence (AI) agent rather than a player.

Search Tree Algorithm General

An algorithm that starts at the root of a search tree and explores its nodes to find a node that satisfies the conditions mentioned in a search problem

Heuristic General

A technique used to find an approximate solution, rather than trying all possible search paths

Depth-limited search General

A technique that will limit the minimax algorithm so that it only explores the game tree from the root node to a given depth

Alpha Beta Pruning General

An optimization technique that compares the current maximum and minimum scores in the game and stops minimax from executing if the minimum score is lower than the maximum

Alpha General

The best (highest) maximum score

Beta General

The best (lowest) minimum score

Recursion General

At a high level, recursion is when a function (or method) calls itself.

Base Case General

The base case is the simplest form of the recursive problem. The base case can be immediately solved without breaking the problem down any further.

Recursive Case General

The recursive case is the general form of the recursive problem. In this case the problem needs to be broken down by one step toward the base case, and the algorithm makes a recursive call to itself to solve this slightly smaller problem. This process repeats until the base case is reached.

Infinite Recursion General

Infinite recursion occurs when the base case can never be reached.

Artificial Intelligence (AI) General

the ability of a digital computer or computer-controlled robot to perform tasks commonly associated with intelligent beings

Human Intelligence General

The ability to perceive and interpret information, and to retain it as knowledge to be applied in the correct context

Turing Test General

A test that determines how realistic, or humanlike a computer system really is. If a human is unable to tell if it is talking to a computer or a human, then the computer is said to have passed the Turing test.

Narrow AI General

AI that is built for a specific purpose and excels in its limited domain

General AI (AGI) General

a more human-like AI; versatile across various cognitive functions and tasks, having broader capabilities