Information for "Zermelo's theorem (game theory)"
Basic information
| Display title | Zermelo's theorem (game theory) |
| Default sort key | Zermelo's theorem (game theory) |
| Page length (in bytes) | 11,511 |
| Namespace ID | 0 |
| Page ID | 25046926 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 59 |
| Number of page watchers who visited in the last 30 days | 4 |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Wikidata item ID | Q2468326 |
| Local description | In board games that cannot end in a draw, one of the two players has a winning strategy |
| Central description | In board games that cannot end in a draw, one of the two players has a winning strategy |
| Page views in the past 30 days |
Page protection
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
Edit history
| Page creator | Arthur Rubin (talk | contribs) |
| Date of page creation | 16:51, 11 November 2009 |
| Latest editor | Sir Ibee (talk | contribs) |
| Date of latest edit | 18:19, 10 January 2024 |
| Total number of edits | 118 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |