HOME > Development > Game Theory Algorithms in Competitive Programming

Game Theory Algorithms in Competitive Programming

  • Development
  • May 12, 2025
SynopsisGame Theory Algorithms in Competitive Programming, available...
Game Theory Algorithms in Competitive Programming  No.1

Game Theory Algorithms in Competitive Programming, available at $84.99, has an average rating of 4.6, with 41 lectures, 20 quizzes, based on 146 reviews, and has 5587 subscribers.

You will learn about Learn in-depth Game Theory Concepts Learn to solve Competitive Programming Questions Problems involving Nim Game, Sprague-Grundy Theorem Combinatorial Games, Subtraction Games, Games as Graphs Learn by solving Easy, Medium & Hard problems Hands-on Coding for every Game Theory Challenge This course is ideal for individuals who are College students pursuing Computer Science or related degrees or Programmers preparing for Competitive Programming competitions or Students who want to deep-dive into Algorithms & Game Theory or Students preparing for ACM-ICPC, IOI, Facebook HackerCup etc It is particularly useful for College students pursuing Computer Science or related degrees or Programmers preparing for Competitive Programming competitions or Students who want to deep-dive into Algorithms & Game Theory or Students preparing for ACM-ICPC, IOI, Facebook HackerCup etc.

Enroll now: Game Theory Algorithms in Competitive Programming

Summary

Title: Game Theory Algorithms in Competitive Programming

Price: $84.99

Average Rating: 4.6

Number of Lectures: 41

Number of Quizzes: 20

Number of Published Lectures: 41

Number of Published Quizzes: 20

Number of Curriculum Items: 61

Number of Published Curriculum Objects: 61

Original Price: ?1,999

Quality Status: approved

Status: Live

What You Will Learn

  • Learn in-depth Game Theory Concepts
  • Learn to solve Competitive Programming Questions
  • Problems involving Nim Game, Sprague-Grundy Theorem
  • Combinatorial Games, Subtraction Games, Games as Graphs
  • Learn by solving Easy, Medium & Hard problems
  • Hands-on Coding for every Game Theory Challenge
  • Who Should Attend

  • College students pursuing Computer Science or related degrees
  • Programmers preparing for Competitive Programming competitions
  • Students who want to deep-dive into Algorithms & Game Theory
  • Students preparing for ACM-ICPC, IOI, Facebook HackerCup etc
  • Target Audiences

  • College students pursuing Computer Science or related degrees
  • Programmers preparing for Competitive Programming competitions
  • Students who want to deep-dive into Algorithms & Game Theory
  • Students preparing for ACM-ICPC, IOI, Facebook HackerCup etc
  • This hands-on course is designed for everyone to learn & implement Game Theory concepts to solve Competitive Programming Challenges. You will learn how approach Game Theory based questions involving – Nim Game, Sprague Grundy Theorem, Subtraction Games, Combinatorial Games, Graph Games, Take-away games! The course involves both breadth and depth of these topics with enough examples and hands-on coding for each problem.

    Competitive programming or Sport Programming is a mind sport usually, involving participants trying to program according to provided specifications. Competitive programming is recognised and supported by several multinational software and Internet companies, such as Google and Facebook. Popular Competitive Programming platforms include Codeforces, Codechef, HackerEarth, HackerRank, Spoj and more! This course is designed for both beginners and advanced programmers looking forward to take the next leap in Competitive Programming!

    Participation in programming contests can increase student enthusiasm for computer science studies. The skills acquired in ICPC-like programming contests also improve career prospects,  which often require candidates to solve complex programming and algorithmic problems on the spot.

    This comprehensive course is taught by Apaar Kamal, who is a highly successful competitive coder and popular bootcamp Udemy Instructor and has taught thousands of students in several online and in-person courses over last 2+ years. This is deep-dive course, we not just delve into theory but focus on the practical aspects by solving multiple game theory problems of various difficulty levels.

    The course starts with basics of Game Theory and then diving deeper topics! Here are some of the topics that you will learn in this course.

  • Combinatorial Games

  • Take-away Games

  • N/P Positions

  • Game of Nim

  • Nim-Sum

  • Applications of Nim-Sum

  • Similar Nim-Games

  • Games as Graphs

  • Sprague Grundy Function

  • Sprague Grundy Theorem

  • 20+ Problems with Code

  • Join me in the course and take the next leap towards becoming a rockstar Competitive Programmer! See you in the course!

    Course Curriculum

    Chapter 1: Introduction

    Lecture 1: Introduction to the course

    Lecture 2: Code Repository

    Chapter 2: Setting Up Sublime Text [optional]

    Lecture 1: Sublime Setup

    Lecture 2: Add master header file

    Lecture 3: Escaping Online Judges

    Lecture 4: Common Code Snippets

    Lecture 5: Using Macros

    Lecture 6: Example Code Explained

    Chapter 3: Take Away Games and Subtraction Games

    Lecture 1: Combinatorial Games

    Lecture 2: Simple Take Away Games

    Lecture 3: Take Away Game (Misère Rule)

    Lecture 4: Examples

    Lecture 5: N/P positions

    Lecture 6: Q. Empty and Divide

    Chapter 4: Nim Game

    Lecture 1: The Game Of Nim

    Lecture 2: Nim Sum

    Lecture 3: Applications Of NimSum

    Lecture 4: Similar Games

    Chapter 5: Sprague Grundy Function

    Lecture 1: Games as Graphs and Sprague Grundy Function

    Lecture 2: Examples of Sprague Grundy Function

    Lecture 3: Coding Sprague Grundy Function

    Chapter 6: Sprague Grundy Theorem

    Lecture 1: Sprague Grundy Theorem

    Chapter 7: Problems Set – I

    Lecture 1: Introduction

    Lecture 2: Game Of Stones

    Lecture 3: Tower Breakers

    Lecture 4: A ChessBoard Game

    Lecture 5: Introduction to NIM Game

    Chapter 8: Problem Set – II

    Lecture 1: Misere NIM

    Lecture 2: Nimble

    Lecture 3: Alice and Bobs Silly Game

    Lecture 4: Poker Nim

    Chapter 9: Problem Set – III

    Lecture 1: Tower Breakers Revisited!

    Lecture 2: Tower Breakers Again Lecture – 1

    Lecture 3: Tower Breakers Again Lecture – 2

    Lecture 4: Zero Move Nim

    Lecture 5: A ChessBoard Game Again

    Chapter 10: Problem Set – IV

    Lecture 1: Digits Square Board

    Lecture 2: Stone Division

    Lecture 3: Chocolate in the Box

    Lecture 4: Kitty and Katty

    Chapter 11: Miscellaneous Problems

    Lecture 1: Codeforces – A lot of Games

    Instructors

  • Game Theory Algorithms in Competitive Programming  No.2
    Apaar Kamal
    Software Engineer at Google
  • Game Theory Algorithms in Competitive Programming  No.3
    Coding Minutes
    Pocket friendly way to learn with experts!
  • Rating Distribution

  • 1 stars: 5 votes
  • 2 stars: 1 votes
  • 3 stars: 10 votes
  • 4 stars: 25 votes
  • 5 stars: 105 votes
  • Frequently Asked Questions

    How long do I have access to the course materials?

    You can view and review the lecture materials indefinitely, like an on-demand channel.

    Can I take my courses with me wherever I go?

    Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!