Learn to calculate on your own.
Youre not using a chess engine properly.
Chess Programming - How to get the best set of moves?
Sort:
Most Recent
Forum Legend
Following
New Comments
Locked Topic
Pinned Topic
Hey!
I have been working on a chess AI for a couple of days, using Python and Niklas Fiekas' chess library. I've already gotten the move generation and the board evaluation bit, however, I can not come up with an effective way of surfing through all the possible moves to find the one that ends with the highest score for black at least three moves ahead. My method was to search every possible black move and then out of each move every possible white move and so on, but that is obviously not quite effective.
What could I do?
Thanks!