44/46 for meh
i think i can make it to nationals (i don't live in a stupidly populated state)
Math Puzzle (hard)
Sort:
Slayer_Of_Players wrote:
Seppppppy wrote:
Ok I guess this really isn't a puzzle, but I saw it in MATHCOUNTS, (I got 29/30 on Sprint):
Prove that if each player has two turns on each move, White has a strategy to not lose.
DM me the answer
got 42/46 on chapter round
rip I got 41 due to a calculator choke in target
TigerBabyHro wrote:
44/46 for meh
i think i can make it to nationals (i don't live in a stupidly populated state)
ooh
that's so good
Feb 27, 2023
0
#37
I got like a 43 i think. Could have gotten like 45 if didn’t choke on target
i got a perfect score at state and went to nationals EXCEPT COVID CANCELED THE FKING EVENT
but trust me mathcounts is really fun so try your best and study and do practice problems on AoPS and stuff because you can only do it in middle school and I learned that too late...
Feb 27, 2023
0
#39
Alright, here's the proof he's looking for:
Let's postulate that white, moving first, is not able to win or draw (we assume that white is losing). However, white can just play Nf3-g1 on move 1, which effectively flips the colors. Based on our assumption, black is now unable to win or draw, and now black is losing. This contradicts our original assumption and proves that it is false. Therefore, white is always able to win or draw. (Q.E.D)
it's not chess-related at all lol
Ok I guess this really isn't a puzzle, but I saw it in MATHCOUNTS, (I got 29/30 on Sprint):
Prove that if each player has two turns on each move, White has a strategy to not lose.
DM me the answer
got 42/46 on chapter round