I have seen many 2 Player Game problems while solving problems on codeforces, and these problems don't follow a specific methodology for solving them. Is there any method or way to go about thinking/modeling these problems in general?
I have seen many 2 Player Game problems while solving problems on codeforces, and these problems don't follow a specific methodology for solving them. Is there any method or way to go about thinking/modeling these problems in general?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
| Name |
|---|



Auto comment: topic has been updated by presumption (previous revision, new revision, compare).
I found a resource once, maybe it helps.
Game theory starts at 147/167 of https://algo.is/aflv16/aflv_10_mathematics.pdf
Personally I draw a graph showing the various outcomes, and I try to find some strategy or pattern. Sometimes there might be a greedy way, or it mist be solved using DP. Sometimes it's unrelated to these at all.
I am not very clever. So for these problems I sometimes print a winner/SG table for small numbers using bruteforce.