benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / ( Melanie Wood )

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

( Melanie Wood )
Alice and Bob play a game on a 6 by 6 grid.  On his or her turn, a player chooses a rational number not yet appearing on the grid and writes it in an empty square of the grid.  Alice goes first and then the players alternate.  When all squares have numbers written in them, in each row, the square with the greatest number is colored black.  Alice wins if she can then draw a line from the top of the grid to the bottom of the grid that stays in black squares, and Bob wins if she can't.  (If two squares share a vertex, Alice can draw a line from on to the other that stays in those two squares.)  Find, with proof, a winning strategy for one of the players.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
b4e34bad-a249-54a2-ab95-c3b0b6485536
task_key
test--b4e34bad-a249-54a2-ab95-c3b0b6485536
task_revision_id
1
config / split
/ test

Official source

initial import