YoVDO

Chess Programming Tournament Results and Analysis

Offered By: Sebastian Lague via YouTube

Tags

Artificial Intelligence Courses Game Development Courses Neural Networks Courses Algorithms Courses Monte Carlo Tree Search Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Dive into an extensive video showcasing the results of a chess programming tournament. Explore the creative code behind various chess bots, watch their games unfold, and discover which bot emerges as the ultimate champion. Learn about different bot strategies, from faithful recreations of classic algorithms to innovative approaches using neural networks and Monte Carlo Tree Search. Witness exciting matches, including exploits and disqualifications, as the tournament progresses through Swiss rounds and knockout stages. Gain insights into chess programming techniques such as piece square table compression and tiebreak systems. Follow the journey from the initial challenge overview to the final dramatic showdown, culminating in a match between the tournament winner and a Coding Adventure bot.

Syllabus

Challenge Overview
Some Exploits and Disqualifications
Beginning the Tournament
[Bot] Turochamp Faithful
[Bot] WhateverBot
[Game] Turochamp Faithful vs WhateverBot
[Game] Pawntress vs WhateverBot
[Bot] applemethod-orz
[Bot] Igris
[Game] applemethod-orz vs Igris
Token Plot
[Bot] BadAppleBot
[Bot] 200 Tokens Monstrosity
[Bot] Baby Squid
[Game] 200 Tokens Monstrosity vs Baby Squid
Tiebreak System
[Bot] TinyHugeBot
[Game] TinyHugeBot vs 200 Tokens Monstrosity
[Bot] Electric Shockwave Gambit
[Bot] SimpleMCTS
[Game] SimpleMCTS vs Electric Shockwave Gambit
[Game] Phoenix Chess vs SimpleMCTS
[Bot] ILVM
[Bot] Les Moutons
[Game] Les Moutons vs ILVM
[Bot] NNBot
[Bot] Game Tech Explained
[Game] NNBot vs Game Tech Explained
[Bot] King Gambot IV
[Game] King Gambot IV vs ILVM
[Game] King Gambot IV vs NNBot
Swiss Results
[Knockout Game] Board 1, Round of 64
[Knockout Game] Board 2, Round of 64
[Knockout Game] Board 9, Round of 64
[Knockout Game] Board 3, Round of 32
[Knockout Game] Board 4, Round of 32
Piece Square Table Compression
Round of 16 Results
[Bot] Tyrant’s V9
[Knockout Game] Board 2, Quarterfinals
[Knockout Game] Board 1, Semifinals
[Knockout Game] Board 2, Semifinals
[Bot] Finalist A
[Final Round] Game 1
[Bot] Finalist B
[Final Round] Game 2
Final Results and Closing Ceremony
[Game] Tournament Winner vs Coding Adventure Bot


Taught by

Sebastian Lague

Related Courses

Adversarial Search
Udacity
AlphaGo - Mastering the Game of Go with Deep Neural Networks and Tree Search - RL Paper Explained
Aleksa Gordić - The AI Epiphany via YouTube
CMU Neural Nets for NLP 2017 - Advanced Search Algorithms
Graham Neubig via YouTube
Neural Nets for NLP 2019 - Advanced Search Algorithms
Graham Neubig via YouTube
Combining Tree-Search, Generative Models, and Nash Bargaining Concepts in Game-Theoretic Reinforcement Learning
GERAD Research Center via YouTube