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 17408
Theory of dynamic processes with several competing actors that try to achieve some goal in a strategic way.
1
vote
The probability that a person succeeds to pick the longest stick from a randomly ordered n s...
If you tried to get the longest stick out of 10, and they were shown to you in random order, how would you proceed?
Here’s a simple strategy, based on the simple idea that it’s daft to pick a stick th …
- 31.6k
1
vote
Why does Min-Max algorithm delays a good move indefinitely?
In the rules of chess, one player can demand a draw when the same position is entered three times. If your opponent can demand a draw, the value of the position is 0 in the best case. So if you look f …
- 31.6k
-1
votes
Assuming an infinite amount of computing resources, would the minmax algorithm always win in...
Nobody knows if chess is a forced win for white, or even a forced draw for white.
If it is a forced win, then white with optimal gameplay will always win. If it is a forced draw, then white with opt …
- 31.6k
1
vote
Determining the existence of a forced win vs determining the best outcome
There's a game named "chomp" where it is mathematically proven that the player who starts has a winning strategy, but finding the winning strategy seems to be very hard.
Given is an n x m rectangula …
- 31.6k
3
votes
How does "solving" a game like connect four or tic-tac-toe work?
For simple games, you use the following strategy:
You check whether a game position is won, lost, drawn, or not decided yet. In the first three cases, the position has a value of +1, -1, or 0. In th …
- 31.6k