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 square-grid
Search options not deleted
user 63681
2
votes
1
answer
200
views
Algorithm to find player position in a 2D grid when all you know is the directional steps he...
Given the 2D grid shown below, where blue tiles can be visited and island tiles cannot.
Given that we do not know the starting position of a player on this grid.
Given that the player can move 1 ste …
- 201
1
vote
Accepted
Finding a hamiltonianISH path in a graph
I ended up using the UCT (MCTS with UCB1) algorithm but with a twist.
Normally, in UCT, the simulation phase is a simulated play-through of a game with moves chosen at random. If the simulated game e …
- 201
3
votes
2
answers
93
views
Finding a hamiltonianISH path in a graph
Problem statement
Given a graph of all the blue squares in the following image where each blue square is connected to other blue squares in all 4 cardinal directions.
Given any starting node.
What …
- 201