Stack Overflow
Stack Overflow

Questions tagged [alpha-beta-pruning]

A search algorithm that seeks to decrease the number of nodes, which are evaluated by the minimax algorithm, in its search tree

For more info see the Alpha-beta pruning wikipedia article.

304 questions
0
votes
1 answer

Alpha beta pruning not producing good results

--------------- Actual Question --------------- Ok, the real problem is not with alpha-beta pruning vs minimax algorithms. The problem is that minimax algorithm when in a tree will give only the best solutions whereas alpha-beta will give the…
unsupo
  • 13
  • 5
0
votes
1 answer

Java Alpha-Beta Pruning in Tic Tac Toe

I have a game of Tic Tac Toe that uses the Minimax Algorithm. I want to improve that by adding alpha-beta pruning. However the alpha-beta method does not seem to be able to calculate moves effectively. It just puts its piece in the next available…
Zuse
  • 93
  • 1
  • 11
0
votes
2 answers

Applying Machine learning with checkers game

I am doing my final year project on Machine Learning for checkers Computer game. In this game i have automated one player ( which moves randomly ) and i want second player to learn against the randomness and become smart by more games and trials. As…
Piyush Singh Chauhan
  • 11
  • 1
  • 4
0
votes
1 answer

Shared Hash Table for parallel chess search

This is a conceptual question about the shared hashtable algorithm for parallel chess search. I have implemented an alpha-beta search that spawns 4 threads, each of which conducts a search and returns the best move/evaluation. However, I am…
dylhunn
  • 989
  • 2
  • 8
  • 25
0
votes
0 answers

Non-recursive Alpha beta pruning implementation

I'm trying to convert the recursive version of Alpha beta pruning to non-recursive one because I have to implement it on CUDA. Here is the recursive version int Bot::minimaxAlphaBeta(Board & board, int depth, bool isMax, int alpha, int beta, int x ,…
Duke
  • 253
  • 1
  • 13
0
votes
1 answer

Minimax: save copy of the board for backtracking

I am trying to implement a Minimax (with alpha beta pruning. My Problem now is that if I evaluate a position and backtrack to the next move in the iteration (one level up) the "currentBoard" is not the initial board but the one from the evaluated…
solaire
  • 475
  • 5
  • 22
0
votes
1 answer

Alpha beta pruning search count

I am trying to play with the alpha beta pruning algorithm; I got the program working. I need to figure out the number of searches was done before alpha or beta value got selected. I am counting the value but I am not sure if the count value is…
jeevjyot singh chhabda
  • 617
  • 4
  • 14
0
votes
1 answer

four connect ai Alpha beta minmax

Hello first of all my English inst very good so excuse me when some things aren't understandable. I wrote a MinMax algorithm for tic-tac-toe and it worked really fine. So I tried myself on a MinMax algorithm for four connect sadly it doesn't work…
Philipp Schweizer
  • 1
  • 1
0
votes
1 answer

How to make an alpha-beta search-based game engine non-deterministic?

I successfully implemented a negascout game engine, which works well, but deterministically. That means I can replay the same game over and over again, because for a given position, the game engine yields the same best move every time. This is…
Peter B.
  • 371
  • 2
  • 16
0
votes
0 answers

C - minimax with zobrist not sending right player for the execution

I have tried to implement minimax with alpha-beta pruning and zobrist hash for an abalone game (being a beginner), before adding the hash table everything worked fine (no strange behavior and no segmentation faults). Now the problem is moves that…
Reda Drissi
  • 1,532
  • 3
  • 20
  • 32
0
votes
1 answer

how to add edit text in svg shape

am doing a game tree for Alphabeta pruning and i have created the tree using svg but now i want to add editable text inside the tree and be able to use the entered value in my calculations. like use the values entered in my calculations. can…
Gizele
  • 9
  • 8
0
votes
2 answers

Negamax for simple addition game

I'm trying to implement negamax for a simple game where the players alternate adding one or two to a running sum. The player that increases the total to 21 wins. I'm using the pseudocode here:…
David Bandel
  • 252
  • 3
  • 19
0
votes
1 answer

Alpha-Beta search truncating my principal variation

I have implemented an alpha-beta search that adds its results to a transposition table. Then, I am extracting the principal variation from the transposition table. This appears to work alright for analysis at shallow depths. However, when I ask for…
dylhunn
  • 989
  • 2
  • 8
  • 25
0
votes
1 answer

Java - Alpha beta pruning for minimax implementation

I'm trying to create an AI player for a game using the minimax algorithm with alpha-beta pruning. I'm having some trouble trying to implement it properly. I have 2 functions to work with, one to evaluate the current state of my board for a given…
Phil O'kelly
  • 161
  • 1
  • 3
  • 14
0
votes
1 answer

Alpha Beta pruning without recursion

Is there anyway to implement Alpha Beta pruning without recursion. Say, you have fixed number of levels, and you are assigning each array all the possible nodes for that particular level. My minimax algorithm works fine with this approach, but can't…
someone
  • 149
  • 8
1 2 3
…
20 21