Ended on 5th Jul'21 03:30 PM (Coordinated Universal Time)
Data Sprint #39: Chess Endgame
129
Medium
Challenge Starts
02 Jul 03:30 pm
Registration Ends
05 Jul 03:30 pm
Challenge Ends
05 Jul 03:30 pm
Problem Statement
Chess endgames are complex domains which are enumerable. Endgame databases are tables of stored game-theoretic values for the enumerated elements (legal positions) of the domain. The game-theoretic values stored denote whether or not positions are won for either side, or include also the depth of win (number of moves) assuming minimax-optimal play.
Objective
Build a machine learning model to calculate the depth of win (i.e. the number of moves required to win the game).
What will you learn?
- Supervised Learning Algorithms - Classification Techniques (Learn ithere)