On K-AP And K-Avoid-AP Van Der Waerden Game

Document Type

Article

Publication Date

3-1-2026

Abstract

Let w(k; 2) be the van der Waerden number such that for every 2-colouring of [1, w(k; 2)] there is a monochromatic k-term arithmetic progression (AP). Consider the following two 2-players games: k-AP game and k-AVOID-AP game. These are two different games between two players, Player 1 and Player 2, on a sequence of integers [1, n] where n ∈ ℤ+. Each player’s aim is to obtain or avoid forming a monochromatic k-term arithmetic progression. The player who first obtains a monochromatic k-term arithmetic progression wins or loses, thus ending the game. In this paper, we investigate these two games and propose a new parameter: the minimum number of turns ŵn(k) (and ŵn(k)) needed for any of the player to win in k-AP (and k-AVOID-AP game respectively). We propose the winning strategies for Player 1 and Player 2 and hence show that ŵn(3) = 5, ŵn(4) = 7 and ŵn(3) = 9. We also have shown that in a k-AVOID-AP game on [1, n], where n is sufficiently large, Player 2 always has a winning strategy if n is even.

Keywords

k-AP game, k-AVOID-AP game, k-term arithmetic progression, van der Waerden number

Publication Title

Journal of the Indonesian Mathematical Society

ISSN

2086-8952

DOI

10.22342/jims.v32i1.1656

Funders

Sunway University

Volume

32

Issue

1

Publisher

The Indonesian Mathematical Society

Share

COinS