34
votes
Solve Grid-Tangram
BBC BASIC, 570 514 490 bytes ASCII
Download interpreter at http://www.bbcbasic.co.uk/bbcwin/download.html
435 bytes tokenised
Full program displays an input from ...
- 25.2k
21
votes
Nonogram line brute-force solving
Ruby, 85 bytes
f=->l,n,s=n-l.sum-l.size+1{*a,b=l;b&&s>0?(a[0]?1+f[a,n-b-2,s-1]:(n.to_f/b).ceil-1):0}
Try it online!
Explanation
The first step is ...
- 651
18
votes
17
votes
Accepted
Shortest 2-Player Game of Halma
The shortest game of halma is 49 moves
49 move solution
Proof there is no 48-move solution
Code used for this solution
The code now supports pass
Notice that the 47 move solution in the paper is ...
- 14.7k
16
votes
Accepted
Cut the gold chain
05AB1E, 23 11 8 bytes
ΔÍN-;иg=
Try it online!
Uses 0-based indexing.
Explanation:
...
- 15.5k
14
votes
Accepted
The fastest Sudoku solver
C++ - 0.201s official score
Using Tdoku (code; design; benchmarks) gives these results:
~/tdoku$ lscpu | grep Model.name
Model name: Intel(R) Core(TM) i7-4930K CPU @ 3.40GHz
~/tdoku$ # ...
- 339
13
votes
Solve the chromatic puzzle
Octave, 334 313 bytes
Since the challenge may seem a bit daunting, I present my own solution. I did not formally prove that this method works (I guess that will come down to proving that the ...
- 9,366
10
votes
Stringing a Pearl Necklace
Python - 1669
Still pretty long, but fast enough to run the last example in under a second on my computer. It's probably possible to make shorter at the cost of speed, but for now it is pretty much ...
- 6,614
10
votes
1D monochrome Link-a-Pix solvability
JavaScript (ES6), 41 bytes
Returns false for valid or true for invalid.
a=>a.some(p=(x,i)=>--p>0?x:a[i+x-1]^=p=x)
Try it online!
Commented
...
- 179k
9
votes
Accepted
Is the word typeable with keys adjacent to each other?
Pyth, 66
?"Yes".Am>2sm^-.uk2Cm.Dx"qwertyuiopasdfghjkl*zxcvbnm"b9.5dC,ztz"No
Try it here.
I was surprised to learn Pyth doesn't have a ...
- 38.9k
9
votes
Accepted
A Tiny Explorer
MATL, 68 59 58 bytes
'?'7XJQtX"'s'jh5e"@2#1)t35>)-1l8t_4$h9M)b'nsew'=8M*sJ+XJ+(
Try it online!
Explanation
The map is kept in the bottom of the stack ...
- 102k
9
votes
Can you beat the British Intelligence? (Nonogram Solver)
Haskell, 242 230 201 199 177 163 160 149 131 bytes
...
- 1,485
9
votes
Cut the gold chain
Python 2, 75 bytes
f=lambda n,i=0:n>=i<<i and f(n,i+1)or[min(n,2**j*i-i+j)for j in range(1,i)]
Try it online!
Explanation:
Builds a sequence of 'binary' ...
- 19.8k
8
votes
Accepted
Solve the 15 Puzzle (the tile-sliding puzzle)
PyPy, 195 moves, ~12 seconds computation
Computes optimal solutions using IDA* with a 'walking distance' heuristic augmented with linear conflicts. Here are the optimal solutions:
...
- 38.9k
8
votes
8
votes
Accepted
Stringing a Pearl Necklace
C, 590 640 760 880 963 1018
Brute force is quite fast for this. The 12x12 test runs under 10ms. Knowing that could opt for some language more appropriate for golfing.
I don't assume the board is ...
- 3,717
8
votes
Accepted
Build a Nonographic Magnitude Optimizer™
Python 2 & PuLP — 2,644,688 squares (optimally minimized); 10,753,553 squares (optimally maximized)
Minimally golfed to 1152 bytes
...
- 4,087
8
votes
8
votes
Cut the gold chain
R, 77 69 bytes
-8 bytes thanks to Aaron Hayman
pmin(n<-scan(),0:(k=sum((a=2:n)*2^a<=n))+cumsum((k+2)*2^(0:k))+1)[-n]
Try it online!
Let \$k\$ be the ...
- 15.4k
8
votes
The fastest Sudoku solver
Node.js, 8.231s 6.735s official score
Takes the file name as argument. The input file may already contain the solutions in the format described in the challenge, in which case the program will ...
- 179k
7
votes
Implement a Brute Force Sudoku Solver
Perl, 120 bytes
Oh, I remember golfing that back in 2008...
And it in fact stopped working in perl 5.12 since implicit setting of @_ by split was removed then. So only try this on a sufficiently old ...
- 14.7k
7
votes
Solve the chromatic puzzle
Lua, 594 575 559 Bytes
Warning There's still lots of work before I'm done with this golfing! I should be able to take that under 500 Bytes, at the very least. For the moment, it's the first solution ...
- 3,065
7
votes
Solve a Matchstick puzzle
JavaScript (ES6), 297 286 279 267 bytes
Takes input in currying syntax (s)(k), where s is an array of digit characters and k is the number of moves (integer).
<...
- 179k
7
votes
Solve a Rubik's Cube
Cubically, 3 bytes
rp▦
Try it online! You can use this to print a random cube.
Explanation:
...
- 13.5k
7
votes
Interactive Maze Solver
JavaScript (ES6), 180 174 bytes
Uses prompt() to output the direction and retrieve the result.
...
- 179k
7
votes
The fastest Sudoku solver
C - 0.045s unofficial score
I got this time on my i7-9750H with 6 cores 12 threads @ 4Ghz. I'm aware that my cpu is faster than the i7-7700HQ so I think (hope) it would be closer to 0.080s if it were ...
- 71
7
votes
1D monochrome Link-a-Pix solvability
Jelly, 15 bytes
Ṁ1;Ṭ×Ʋ€ṚœṣF¥ƒ⁸Ẹ
Try it online!
A monadic link taking a list of integers and returning 0 for those that have a ...
- 16.7k
6
votes
6
votes
Solve the 15 Puzzle (the tile-sliding puzzle)
JavaScript (ES6) total steps 329 for all 5 test cases in ~1min
Edit Same strategy, different targets, better solution. Slower ...
This is more or less how I solve it by hand: using intermediate ...
- 31.9k
6
votes
Build a poisoned wine testing scheduler
Python 2.7.9 — 21 bottles
Assuming that ESultanik's speculation is right on what the input is when multiple prisoners die
...
- 6,179
Only top scored, non community-wiki answers of a minimum length are eligible