heuristic search fig the connect four game algorithm the base cases for minimax are then modified as follows to incorporate the search cutoff heuristic the current board is win for the computer in that case minimax returns for computer win the current board is win for the human in that case minimax returns - for human win the current board is full in that casesince neither human or computer wonminimax returns the maximum depth has been reached evaluate the board with no more search and report number between - and negative value indicates the human is more likely to win given this board positive value indicates the computer is more likely to win to implement this last base case for the algorithma new depth parameter is passed to the minimax algorithm and possibly some other parameters as well early in game the maximum depth may not be very deep howeverlater in gamewhen less choices are availablethe maximum depth may be deeper increasing the depth of search is the best way to improve the computer' ability to win at games like this good heuristic can also help in earlier stages of the game when deeper search is not possible coming up with good heuristic is challenge the trick is to keep it relatively simple to compute while encouraging moves in some fashion on the board this copy belongs to 'acha