Scribd
Upload
57 views20 pages

Game Theory Probabilities

Uploaded by

Matthew V
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
57 views20 pages

Game Theory Probabilities

Uploaded by

Matthew V
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

Game theory and

probabilities
Solving a game
A solved game is a game whose outcome (win, lose or draw) can be correctly predicted from any
position assuming that both players play perfectly.

Weakly solved
- provide an algorithm that secures a win for one player, or a draw for either, against any
possible moves by the opponent from the beginning of the game

Strongly solved
- provide an algorithm that can produce perfect moves from any position, even it
mistakes have already been made on one or both sides.
Example of combinatorial games and status
Tic - Tac - Toe

Connect Four (1988) - the first player can force the win

GO - weakly solved for 7x7 board (2015) - Humans usually play on 19x19 (10^145 mai
complex)

Chess - nothing yet (but strongly solved for endings #pieces <= 7)

Losing chess (Antichess / Mange) - weakly solved in 2016


The player that has 0 pieces left wins?
Capturing is compulsory
The king has no royal power
Impartial games
Combinatorial games where:
● There are two players
● There is a finite set of positions available in the game
● Rules specify which game positions each player can move to
● Players alternate moving
● The games ends when a player can make a move
● The game eventually ends
● The set of allowable moved depends only on the position of the game and not on which of the two
players is moving
P and N positions
N-position -> positions that are winning for the Next player to move

P-position -> positions that are winning for the Previous player (the player who just
moved)
How to find them?
Usually by induction
-> Label every terminal position as a P-position
-> Label every position that can reach a labeled P-position as an N-position
-> Find those position whose only moved are to labelled N-positions; label such positions as
P-positions
-> return to the second step

Optimal strategy = moving in a P-position


The game of NIM
Three piles of chips containing x 1, x2, and x3 chips. Each move consists of selecting one of the piles and removing
chips from it. You may not remove chips from more than one pile in one turn, but from the pile you selected you
may remove as many chips as desired, from one chip to the whole pile. The winner is the player who removes the
last chip.

Good game (5, 7, 9)

Two piles?
Three piles?
Generalization?
Graph games
You are given a DAG, and a pawn in the DAG. The pawn can move along the edges in the direction of the edges.
The player who moves last loses.
Graph game
Sprague-Grundy Function
Adding games
Sprague-Grundy Theorem
Proof (only the general direction)
Grundy’s Game
Probleme + Bibliografie
https://www.infoarena.ro/problema/nim -> classic
https://cses.fi/problemset/task/1098 -> problema cu bomboane
https://cses.fi/problemset/task/1099 -> staircase nim
https://cses.fi/problemset/task/2207 -> grundy’s game
https://www.spoj.com/problems/BOMBER/ -> tot grundy’s game
https://codeforces.com/gym/102565/problem/H
https://codeforces.com/contest/1404/problem/B

https://cses.fi/book/book.pdf
https://web.mit.edu/sp.268/www/nim.pdf
Probabilities
Expected value

Exemplu: Expected value for a dice roll = 3.5


Number of trials until success
https://www.cut-the-knot.org/Probability/LengthToFirstSuccess.shtml
Some problems can be solved with random

Ex: Element majoritar

Algoritmi clasici:
- Quick Sort
- Primality checking
- Treap-uri
Probleme
https://codeforces.com/problemset/pro https://codeforces.com/gym/104786/problem/C
blem/839/C https://codeforces.com/gym/104328/problem/F

https://codeforces.com/gym/104328/problem/D
https://codeforces.com/problemset/pro
blem/1305/F

Bibliografie
https://codeforces.com/problemset/pro https://profs.info.uaic.ro/~adrian.zalinescu/PS.html
blem/1523/D
https://codeforces.com/blog/entry/62690
https://codeforces.com/contest/1453/p https://brilliant.org/wiki/linearity-of-expectation/
roblem/D

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy