A finite goal set in the plane which is not a Winner
Combinatorics
2011-01-25 v1 Computer Science and Game Theory
Abstract
J. Beck has shown that if two players alternately select previously unchosen points from the plane, Player 1 can always build a congruent copy of any given finite goal set G, in spite of Player 2's efforts to stop him. We give a finite goal set G (it has 5 points) which Player 1 cannot construct before Player 2 in this achievement game played in the plane.
Cite
@article{arxiv.1101.4420,
title = {A finite goal set in the plane which is not a Winner},
author = {Wesley Pegden},
journal= {arXiv preprint arXiv:1101.4420},
year = {2011}
}
Comments
8 pages, 4 figures