This was the finals for the first tournament
Most Recent
Forum Legend
Following
New Comments
Locked Topic
Pinned Topic
I programmed many chess AIs and ran a tournament and i want to do a second with more AIs, but this has already been done before so I added a twist.
Each AI is only allowed to know about each move.
1. The number of legal moves the opponent would have.(A)
2. Number of legal moves it will have assuming that the opponent is trying to minimize your moves.(B)
The AI will minimize the formula you put in with no tree search.
For example the winner of the first tournament was.
max(A, 100-B)
This means that it will try to keep down opponent moves while keeping his own moves high.
If anyone has any ideas they will have a chance to have their AI declared the best easy AI.