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 |
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.
1
vote
Sudoku net that is always solvable
Well i dont want to be abnoxious but i dont think kevin's answer can work out neither the enhaced grid do.
its not about uniqueness but it is all about validity of solution .
this is a co …
0
votes
Minimum cells to fill grid without consecutive neighbours
this is ...
a checkerboard by two lines step in case of :
-$n$ and $m$ are odd
knight shortest path in case of $4m*4n$ grid with supplementary adjustements
-if the grid is $4n*(4m+2)$ like the …