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 optimization
Search options not deleted
user 32641
A puzzle where you have to optimize a certain objective function (maximize profit, minimize cost). There should ideally be a provable best answer, to avoid making the puzzle into an [open-ended] game.
2
votes
Will a greedy algorithm solve Tatham's Flood?
Using a greedy algorithm usually gets you to a nearly optimal solution, or even optimal, but it's no ensured.
If you want to find the solution that gets you to solve the puzzle in minimum moves (that …
- 121