How to calculate the leaf node score of gobang game tree algorithm with c language
Actually, this is not a difficult point. This score is the chess shape formed in the 9x9 matrix with the chess piece as the center after the current movement. It is obviously meaningless to calculate the chess shapes in other places. And you don't have to write the algorithm in C language. For minimax principle, game tree and alpha-beta pruning algorithm are based on this principle. If you just learn programming and have no data structure foundation, you won't write gobang with game tree algorithm. First,.