I am writing a game. If you assume I have the game tree, can you suggest a good minimaxing algorithm. I have one, but it doesnt always work brilliantly. Any suggestions.
I basicly find the smallest value of the opponent moves and group them into board positions. (Ie smallest value while at (i,j) when the counters before that are moving across possible positions). Then with the last AI piece I find the biggest. Find where opp was at when that was in that position. And then trace back to were the first piece needs to go to hope opp takes that position.
It seems to work at first, but as more positions are added in game it gives up