Evaluates any position in seconds, with ratings over 2,000 ELO.
There are more chess positions than atoms in the known universe(10^111). Evaluation of a position is done by generating a tree structure that contains every possible board state to a certain depth. The root of the tree is the current game state and each branch is a possible move. Branches terminate when at the max search depth, or if the branch score drops too low. Each branch score is calculated by the value of the piece’s in addition to their locations. This engine is a fork of the Sunfish engine.
But you never win, checks all possible board states, and might beat you.
The board state is stored using a 3 x 3 array. The algorithm traverses and evaluates a tree structure which contains every possible board state. The root of the tree is the current game state and each branch is a possible move. Branches terminate when there is a winner or a tie. Terminal branches are then compared to the best found so far and updated.The algorithm will always tie, or win, never lose.
Solves itself instantly and is rendered in-browser with intuitive controls.
The cube has more states than grains of sand on all of earth's beaches (10^40). Solving is completed in stages; the top cross, then top corners, and so on...only one piece is solved at a time. First the piece is located and based on the piece's location the algorithm begins to move toward a solved state. The state is stored using a 6 x 3 x 3 array and is rendered using TheeJS.
More project coming soon! Checkout my GitHub or linkedIn and get in touch!