100F Problem 6.3 (Kalah Tournament) This is an extraordinary problem, in which we implement adversarial search as a tournament. You can implement all search methods, e.g., to simulate a move or compute the full game tree etc. Submission parameters: Team size: as before, 4 people per team Deadline: 2022-01-09 Site: The submission site will be opened later. Format: The details will be published later. But you can use any programming language, and your program might be subject to resource constraints (overall space for the binary, time per move, etc.). Points: Submissions that are better than a relatively low baseline (e.g., win against a player that makes random moves) will receive 100 points. The team with the best agent receives an additional 100 points, the 2nd team 90 points, the 3rd 80 etc. Further details will be announced in the forum as they come up