Paper Title :The (i,j)-4 × 4-Outflanking-Stab Game (OS game)

Author :Sukavich Buddaphes, Nantapath Trakultraipruk

Article Citation :Sukavich Buddaphes ,Nantapath Trakultraipruk , (2021 ) " The (i,j)-4 × 4-Outflanking-Stab Game (OS game) " , International Journal of Management and Applied Science (IJMAS) , pp. 8-14, Volume-7,Issue-6

Abstract : Let 𝑖,𝑗,𝑚, and 𝑛 be positive integers such that 𝑚,𝑛 ≥ 2. An (𝑖,𝑗)−𝑚 × 𝑛−Outflanking-Stab game is played on an 𝑚 × 𝑛 board by two players: White (the first player) and Black (the second player). Each player has 𝑛 tokens, which can be moved like the rook in chess. White gets 𝑖 moves per turn, and Black gets 𝑗 moves per turn. There are two ways to capture oppenent’s tokens, which are outflanking and stab. A player wins when he makes the opponent cannot move any token or all opponent’s tokens are captured. In this paper, we prove that for the (𝑖,𝑗)−4 × 4−OS game, White has a winning strategy if 𝑖 ≥ 4, or 𝑖 ≠ 1 and 𝑗 = 1 while Black has a winning strategy if 𝑖 = 1 and 𝑗 ≥ 2. Keywords - Makneeb, OS Game, Checkers, Chess, Board Game, Multimove.

Type : Research paper

Published : Volume-7,Issue-6

	|		PDF	|	Viewed - 58	|	Published on 2021-10-11