Abstract

We present a game inspired by research on the possible number of billiard ball collisions in the whole Euclidean space. One player tries to place n static “balls” with zero radius (i.e., points) in a way that will minimize the total number of possible collisions caused by the cue ball. The other player tries to find initial conditions for the cue ball to maximize the number of collisions. The value of the game is $$\sqrt{n}$$ (up to constants). The lower bound is based on the Erdős-Szekeres Theorem. The upper bound may be considered a generalization of the Erdős-Szekeres Theorem.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.