Transversal achievement game on a square grid

01/04/2021
by   Niranjan Krishna, et al.
0

This paper intends to solve the Transversal achievement on an n times n grid problem proposed by Dr. Martin Erickson. We approach the problem using mathematical induction and case analysis and prove the hypothesis that for all n greater than 1, the game is a draw.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/26/2015

Solving a Mathematical Problem in Square War: a Go-like Board Game

In this paper, we present a board game: Square War. The game definition ...
research
07/31/2020

Quixo Is Solved

Quixo is a two-player game played on a 5×5 grid where the players try to...
research
07/13/2023

An update on the coin-moving game on the square grid

This paper extends the work started in 2002 by Demaine, Demaine and Veri...
research
04/23/2019

Cops and robbers on oriented toroidal grids

The game of cops and robbers is a well-known game played on graphs. In t...
research
07/15/2018

Multi-objective Non-cooperative Game Model for Cost-based Task Scheduling in Computational Grid

Task scheduling is an important and complex problem in computational gri...
research
09/12/2022

Introducing Grid WAR: Rethinking WAR for Starting Pitchers

Traditional methods of computing WAR (wins above replacement) for pitche...
research
02/20/2022

Resolution to Sutner's Conjecture

Consider a game played on a simple graph G = (V,E) where each vertex con...

Please sign up or login with your details

Forgot password? Click here to reset