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 decision-problem
Search options not deleted
user 36445
For challenges which involve deciding whether or not the input meets certain criteria, and outputting some data, representing that decision.
2
votes
The ultimate inequality challenge
Sledgehammer, 17 bytes
16.75, to be overly specific
⣕⢌⢲⢼⠴⢺⢟⢼⣑⣮⣊⠞⠀⢄⡕⡝⢥
There's no point in trying to read that, so here's the corresponding Mathematica code with a reasonable explanation:
ToExpression …
- 8,445
7
votes
Is this number evil?
evil, 48 42 40 39 36 35 bytes
golf 1: flipping many ms to js and js to ms saved quite a bit of marking mode changes
golf 2: do..while -> repeat..until
golf 3: tbxb -> sxb - can be seen to be the same …
- 8,445
4
votes
Holey Knight's Tour
Sledgehammer, 29 bytes
⠑⡘⣡⡪⡾⢸⢹⣎⡷⡬⢵⣅⢞⣽⣤⡥⠃⠏⢂⢜⠩⡬⢸⠜⡻⣠⡪⢄⡯
That's not very readable, so here's the corresponding Mathematica code:
AnyTrue[Thread@
FindHamiltonianPath[
Subgraph[KnightTourGraph[#2, …
- 8,445