Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with game-theory
Search options answers only
not deleted
user 22714
Theory of dynamic processes with several competing actors that try to achieve some goal in a strategic way.
4
votes
Accepted
Optimal strategy in repeated cake-cutting
Let $v(x) = \frac{V(x) - V(0)}{V(1) - V(0)}$ so $v(x)$ nicely goes from $0$ to $1$. Maximizing $v$ also maximizes $V$. To cover my ass for future mistakes regarding $<$ vs $\leq$, I will assume that y …
- 13.9k
5
votes
Accepted
How does "solving" a game like connect four or tic-tac-toe work?
In short, minimax is what you're looking for.
We say that a game is valued $1$ if player 1 wins, $-1$ if player 2 wins and $0$ if it's a tie.
You have your brute-forced game tree. At each level you …
- 13.9k