__Dangcoder__'s blog

By __Dangcoder__, history, 3 weeks ago, In English

Finally, justice has been served to Bob!! 😭

In 2272F — Tree Reduction Game, Alice still gets the first move, but Bob finally gets some compensation: he can choose the initial root of the tree!

With the right choice, Bob can guarantee his victory even when playing second. No more suffering from always going second — Bob is finally getting his chance to shine!

Come on, Bob, you got this! 🗿

Upd: Bob really cooked this game. =DD
After a lot of research, the result surprised me

chart:

It is easy to see that when n is odd, Bob always wins. If n is even, Bob's win rate increases gradually until it reaches 100%, regardless of the number of nodes (I tested n up to $$$10^5$$$).

proof:
  • Vote: I like it
  • +168
  • Vote: I do not like it

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

haha :)

»
3 weeks ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

Alice just wants to get some work done and Bob being Bob treats it like a game and ruins everything! NO FAIR

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by __Dangcoder__ (previous revision, new revision, compare).

»
3 weeks ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

(≧▽≦)

I was waiting for this blog fr

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by __Dangcoder__ (previous revision, new revision, compare).

»
12 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

FAIR :)