alpha-beta-pruning

I am currently writing a minimax algorithm with alpha beta pruning for Chess. From all the examples I have seen, minimax algorithm will return an int value that represents that best score or board state that will result from the best move. My question is how can we return the best move that is associated with the score return value? For example, my alphabeta() in pseudo below ... public int alphabeta(int depth, Board b, int alpha, int beta, boolean maxPlayer) { if(depth == 0) return evaluateBoard(b); if(maxPlayer) { for(each of max player's moves) { // make move on a tempBoard int eval =

I'm trying to learn about artificial intelligence and how to implement it in a program. The easiest place to start is probably with simple games (in this case Tic-Tac-Toe) and Game Search Trees (recursive calls; not an actual data structure). I found this very useful video on a lecture about the topic. The problem I'm having is that the first call to the algorithm is taking an extremely long amount of time (about 15 seconds) to execute. I've placed debugging log outputs throughout the code and it seems like it is calling parts of the algorithm an excessive amount of times. Here's the method

I understand the basics of minimax and alpha-beta pruning. In all the literature, they talk about the time complexity for the best case is O(b^(d/2)) where b = branching factor and d = depth of the tree, and the base case is when all the preferred nodes are expanded first. In my example of the "best case", I have a binary tree of 4 levels, so out of the 16 terminal nodes, I need to expand at most 7 nodes. How does this relate to O(b^(d/2))? I don't understand how they come to O(b^(d/2)). Please, can someone explain it to me? Thans a lot! O(b^(d/2)) correspond to the best case time complexity

I'm working on an AI for a game and I want to use the MinMax algorithm with the Alpha-Beta pruning . I have a rough idea on how it works but I'm still not able to write the code from scratch, so I've spend the last two days looking for some kind of pseudocode online. My problem is that every pseudocode I've found online seems to be based on finding the value for the best move while I need to return the best move itself and not a number. My current code is based on this pseudocode ( source ) minimax(level, player, alpha, beta){ // player may be "computer" or "opponent" if (gameover || level ==