pith. sign in

arxiv: 1101.4420 · v1 · pith:V6B4NXAHnew · submitted 2011-01-24 · 🧮 math.CO · cs.GT

A finite goal set in the plane which is not a Winner

classification 🧮 math.CO cs.GT
keywords playerfinitegoalplanepointsachievementalternatelyalways
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.