Yahoo India Web Search

Search results

1. www.javatpoint.com › ai-alpha-beta-pruningArtificial Intelligence | Alpha-Beta Pruning - Javatpoint

   www.javatpoint.com › ai-alpha-beta-pruning

   • Cached

   Learn how alpha-beta pruning is a modified version of the minimax algorithm that reduces the number of nodes to examine in a game tree. See the condition, pseudo-code, working, and move ordering of alpha-beta pruning with examples and diagrams.

2. www.geeksforgeeks.org › minimax-algorithm-in-gameMinimax Algorithm in Game Theory | Set 4 (Alpha-Beta Pruning)

   www.geeksforgeeks.org › minimax-algorithm-in-game

   • Cached

   Jan 16, 2023 · Learn how to optimize the minimax algorithm for game theory using alpha-beta pruning, a technique that cuts off branches in the game tree. See pseudocode, C++ implementation and output for a simple example.

3. www.geeksforgeeks.org › alpha-beta-pruning-inAlpha-Beta pruning in Adversarial Search Algorithms

   www.geeksforgeeks.org › alpha-beta-pruning-in

   • Cached

   Jun 13, 2024 · Learn how to use alpha-beta pruning, an optimization technique for minimax, to reduce the search space in game playing and decision-making problems. See the concept, implementation, and advantages and limitations of this approach.

4. www.scaler.com › alpha-beta-pruningAlpha Beta pruning - Scaler Topics

   www.scaler.com › alpha-beta-pruning

   • Cached

   May 15, 2023 · Learn how to optimize the Minimax algorithm using Alpha Beta Pruning, an adversarial search technique that prunes redundant branches of a game tree. See the algorithm details, pseudocode, working example and applications in AI.

5. www.mygreatlearning.com › alpha-beta-pruning-in-aiAlpha Beta Pruning in AI - Great Learning

   www.mygreatlearning.com › alpha-beta-pruning-in-ai

   • Cached

   Sep 2, 2024 · Learn what alpha beta pruning is, how it optimises the minimax algorithm for decision trees, and how it works with examples. The blog also explains the minimax algorithm, the condition for alpha beta pruning, and the intuition behind this technique.

6. www.almabetter.com › alpha-beta-pruningAlpha Beta Pruning in AI - AlmaBetter

   www.almabetter.com › alpha-beta-pruning

   • Cached

   Sep 1, 2024 · Learn how Alpha Beta Pruning optimizes minimax search algorithms for game-playing AI and decision trees. Understand the concepts of Alpha and Beta values, pruning rules, and pseudo code with examples.

7. People also ask

   What is alpha beta pruning?

   • Alpha Beta Pruning is an optimization technique of the Minimax algorithm. This algorithm solves the limitation of exponential time and space complexity in the case of the Minimax algorithm by pruning redundant branches of a game tree using its parameters Alpha (\alpha α) and Beta (\beta β).

   Alpha Beta pruning | Scaler Topics

   www.scaler.com/topics/artificial-intelligence-tutorial/alpha-beta-pruning/

   See all results for this question

   What is alpha-beta pruning in AI?

   • As the Alpha-Beta Pruning algorithm in AI progresses and evaluates nodes, Alpha and Beta are updated to reflect the best-known values for each player within a specific branch. These initial values are crucial to the pruning process, allowing us to efficiently identify promising branches and discard unproductive ones.

   Alpha Beta Pruning in AI - AlmaBetter

   www.almabetter.com/bytes/tutorials/artificial-intelligence/alpha-beta-pruning

   See all results for this question

   Why is alpha-beta pruning better than a minimax algorithm?

   • Efficiency: Alpha-beta pruning significantly reduces the number of nodes evaluated compared to the basic minimax algorithm, making the search process faster. Optimality: Despite pruning, alpha-beta pruning does not affect the final decision; it still guarantees finding the optimal move.

   Alpha-Beta pruning in Adversarial Search Algorithms

   www.geeksforgeeks.org/alpha-beta-pruning-in-adversarial-search-algorithms/

   See all results for this question

   What is alpha-beta pruning?

   • Alpha-beta pruning is a modified version of the minimax algorithm. It is an optimization technique for the minimax algorithm. As we have seen in the minimax search algorithm that the number of game states it has to examine are exponential in depth of the tree. Since we cannot eliminate the exponent, but we can cut it to half.

   Artificial Intelligence | Alpha-Beta Pruning - Javatpoint

   www.javatpoint.com/ai-alpha-beta-pruning

   See all results for this question

8. en.wikipedia.org › wiki › Alpha–beta_pruningAlpha–beta pruning - Wikipedia

   en.wikipedia.org › wiki › Alpha–beta_pruning

   • Cached

   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 (Tic-tac-toe, Chess, Connect 4, etc.).