1 / 8

The Clique Game

The Clique Game. V í t Jel í nek, Jan K á ra, Robert Šámal Mentor: Dr. József Beck. The Rules of the Game. Two players take turns to color the edges of a complete graph on N vertices Each player wants to create a clique of size q with all its edges colored with his color

nike
Download Presentation

The Clique Game

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. The Clique Game Vít Jelínek, Jan Kára, Robert Šámal Mentor: Dr. József Beck

  2. The Rules of the Game • Two players take turns to color the edges of a complete graph on N vertices • Each player wants to create a clique of size q with all its edges colored with his color • If all the edges are colored and no monochromatic clique of size q exists, the game is a draw

  3. Observations • The second player can never have a winning strategy • If q is fixed and N islarge enough, draw is impossible (Ramsey theorem), so the first player has a winning strategy • Problems: • How to find an explicit winning strategy? • What if the board is smaller than the corresponding Ramsey number? • What if the board is infinite?

  4. Our Project • We studied the K4 game on the infinite board • We found an explicit winning strategy for the first player • The proof is based on backtracking through the variation tree, improved by some observations about the game

  5. Basic Idea of the Strategy • Step 1: make a triangle faster than your opponent (use our opening book) • Step 2: try to create a rabbit (see next slide) by adding edges connected to your triangle • Step 3: sooner or later, you reach a winning configuration (see next slide) and win

  6. Winning Configurations

  7. Pruning the Variation Tree

  8. More Work to Do • Formulate the strategy and the proof in a clear and concise way • Try to further simplify the proof • Calculate the exact number of moves and vertices needed in the worst case • Write an article • Try to generalize to some Kn game, for n>4 (more ideas needed)

More Related