Intro to AI Flashcards
What is an heuristic?
- Some additional info - rule, function or constraint - that informs a rather brute-force algorithm to act in a more optimal manner
- In a search routing problem is an estimate of the least cost from a node to the goal.
Important AI algorithms?
- A* Search
What are tuples?
- A tuple is a sequence of immutable Python objects.
- Similar to lists
- tuples cannot be changed
- tuple with single value needs to include a comma
Important strategy in search?
- Pruning the possibilities tree
What is intelligence?
- Intelligence is the ability to be good at a certain task. Intelligence should only be judge in the context of a task
In AI what is environment, agent and state?
- Agent is the software to solve the task. It is the roomba vacuum
- Environment are the things which the agent has to interact to solve the problem. With the roomba example it is the floor, dirt and all the obstacles on the floor
- The state refers to the current status of the relevant properties of the Environment. It is related to the information that the agent needs to store about the environment necessary to completing the task. Like the map of the obstacles and the already cleaned areas with the roomba.
In AI what is perception, action and cognition?
- Perception is the sensing of the relevant properties of the environment.
- Actions are outputs from the agent that change the state of the environment
- The decisions of what actions to make based of the perception of the environment is called Cognition
Types of AI problems based on environment characteristics?
- Fully observable (tic tac toe) or partially observable (Battlefield)
- Deterministic or Stochastic
- Discrete (Finite number of states) or Continuous (Infinite number of states)
- Benign (The only one making outputs to achive the goal , also the random things)or Adversarial (Other agents to defeat its goal)
What is rational behavior?
Intelligent agent that through its actions tries to maximize its utility given its goal
What is bounded optimality?
Example: find a route that is not more than 2 miles longer than the optimal route
What is minmax algorithm, alpha beta pruning?
- Minmax: what is the best move in every turn
- Alpha beta pruning: Helps to optimize minmax to make it quicker
What is extectomax algorithm?
- It is an adaptation of minmax for undetermined problems.
- It considers all the possible outcomes and chooses the ones with the max expected return.
Minmax algorithm
- For each node with max choose the maximum value and viceversa
What is depth limited search?
- Limit the depth of the search tree to an amount that is possible and accordingly with our needs
- Use an evaluation function when you reach the max level of depth in the tree to select the best available option. In the isolation game it could be a good idea to select the node that gives the player the most amount of available moves. To use this you have to do a quiscent search to see at what level of the tree the results stop changing very radically. This helps to know if the level of depth is adequate