Paper Title
The 𝑖, 𝑗 − 4 × 4 −Outflanking-Stab Game (OS game)

Abstract
Let i,j,m, and n be positive integers such that m,n ≥ 2. An (i,j)-m × n-Outflanking-Stab game is played on an m × n board by two players: White (the first player) and Black (the second player). Each player has n tokens, which can be moved like the rook in chess. White gets i moves per turn, and Black gets j 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 (i,j)-4 × 4-OS game, White has a winning strategy if i ≥ 4, or i ≠ 1 and j = 1 while Black has a winning strategy if i = 1 and j ≥ 2. Keywords - Makneeb, OS Game, Checkers, Chess, Board Game, Multimove.