• The problem of the form of the first and second moves against each other.
  • Attributing to Nim or using Grundy number are well-known solutions, but of course the problem is not simply attributed, but twisted.

Fundamentals of combinatorial game theory and algorithms for determining winners and losers in Grundy numbers | Algorithmic Logic

D - Directed Graphs and Numbers arc038_d B - Operation Stone Removal arc046_b L - Deque DP L K - Stones DP_K D - An Ordinary Game arc064_b C - Parity tkppc4_2_c B - squares and pieces arc038_b Summary of game problems in competitive programming Nim, Grundy numbers, regression analysis, minimax method - Hamayan Hamayan Hamayan

  • ARC 013 C. Can you make me laugh?
  • AGC017 Game on Tree Description
  • ARC087 Prefix-free Game Description
  • ARC091 Strange Nim Description1 Description2
  • ARC 038 C. Teacups and beans
  • ARC038 Directed Graphs and Numbers Description
  • AGC020 Move and Win Description
  • EDPC Deque Description
  • ARC085 ABS Description

interactive


This page is auto-translated from /nishio/対戦系問題 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.