Transversal achievement game on a square grid
Combinatorics
2021-09-14 v2 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.2101.00770,
title = {Transversal achievement game on a square grid},
author = {Niranjan Krishna},
journal= {arXiv preprint arXiv:2101.00770},
year = {2021}
}
Comments
The Proof has an error