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 logical-deduction
Search options not deleted
user 3993
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).
11
votes
Up to your head in trouble
You can bury your head down first, up to your neck. In that way, you can easily get loose and survive. If you make a hole first, put some loose sand on the side, then you can put your head in, take a …
- 1,787
4
votes
Accepted
A big tennis tournament
In every game that will be played, there is one loser. Because you need $1$ champion (and $999$ losers), you need
- 1,787
4
votes
Accepted