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 that requires formal logical deduction to arrive at the solution. This suggests more than merely reasoning through clues to find an answer (you might want [situation] for that).
2
votes
Accepted
How to remember without writing, a subset of 1000 numbers
This appears to be a question of data representation, optimizing both for efficiency (in the classical computer science sense) and human-friendliness. I'm not sure there are objective ways of measurin …
18
votes
2
answers
970
views
Pipes Puzzle Uniqueness
In the puzzle game Pipes, a space-filling tree of pipes (which may have either one, two, or three neighboring connections each, but not four) is scrambled by a series of tile rotations, and the goal i …
8
votes
3
answers
434
views
Toroidal Pipes Puzzle: T's and Bulbs Only
A continuation in the Pipes puzzle series.
Problem statement for math nerds: Let $G(N)$ denote the graph consisting of cardinally adjacently linked lattice points on an $N \times N$ toroidal grid. For …
7
votes
1
answer
348
views
Existence of index-uniform Hashi puzzles
On the left, we have a starting configuration for a game of Hashi, and on the right, its solution:
That is to say, the goal is to make connections (planar, and traveling only in cardinal directions) …