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 not deleted
user 30800
6
votes
Algorithm to solve Sokoban-like game on graphs - move chips from one set of vertices to another
Here is a polynomial-time algorithm. I assume that the chips are identical, as in Dima's reformulation and in Sokoban. (Another version would be that the chip from Init$_i$ has to go to Final$_i$, for …
- 1,083
1
vote
Algorithm to solve Sokoban-like game on graphs - move chips from one set of vertices to another
The better analogy when the markers are distinct is not Sokoban, but the 15-puzzle. It is even on an undirected graph.
All my remarks below are about the undirected version. ADDITION: At the end ther …
- 1,083