# Tag Info

## Hot answers tagged optimization

### Write Moby Dick, approximately

///, 2*1 + 1020874 = 1020876 Prints a space.
• 18.6k

### Write Moby Dick, approximately

Perl, 2·70525 + 326508 = 467558 Predictor ...
• 2,599

### Write Moby Dick, approximately

Node.js, 2*224 + 524279 = 524727 Please refer to the change log at the end of this post for score updates. A function taking and returning a byte. ...
• 193k

### Write Moby Dick, approximately

Python 3, 2·267 + 510193 = 510727 Predictor ...
• 39.7k

### Write Moby Dick, approximately

Python 3, 2*279+592920=593478 2*250 + 592467 = 592967 2 * 271 + 592084 = 592626 2 * 278 + 592059 = 592615 2 * 285 + 586660 = 587230 2 * 320 + 585161 = 585801 2 * 339 + 585050 = 585728 ...

### Write Moby Dick, approximately

C++, score: 2*132 + 865821 = 866085 Thanks to @Quentin for saving 217 bytes! ...
• 16.5k

### Write Moby Dick, approximately

Python, 2*516 + 521122 = 522154 Algorithm: Yet another python submission, this algorithm calculates the most likely next letter looking at sequences of length 1,...,l. The sum of probabilities is ...
• 648

### Hunt for discount

Python 3, 33 bytes lambda a:sum(sorted(a)[-2::-2])/2 Try it online! This is my first answer :D
• 553

### Write Moby Dick, approximately

C++, 2·62829 + 318786 = 444444 To run this program, you need this file here, which must be named C. The program uses the same combination of Markov models as in ...
• 2,599

### Make me a minimum magic sum

Python 2, 44 bytes a,b,c,d=sorted(input()) print min(c-a,d-b)*2 Try it online! Sorts the input as a,b,c,d, in ascending ...
• 145k
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.9k

### Island Golf #1: Circumnavigation

Mathematica (version 9), 165 bytes The nice, short ConvexHullMesh function that Greg Martin used was only introduced in Mathematica version 10, so I thought I'd ...
• 3,206

### Plight of the Concorde

88 Cities, 341 seconds runtime on NEOS In a recent paper we constructed a family of hard to solve euclidean TSP instances. You can download the instances from this family as well as code for ...

### Given a list of circles, output the area of the smallest containing rectangle

Python 2 + PySCIPOpt, 267 bytes ...
• 39.7k

### Find the maximum deviation

Dyalog APL, 7 bytes ⌈/⌈/-⌊/ Test it on TryAPL. How it works ...
• 210k

• 59.5k

### Island Golf #1: Circumnavigation

(But go upvote Notatree's solution, it's better!) Mathematica, 168 bytes ...
• 15.8k
Haskell, 67 61 bytes f n=minimum$n:[f$div n d|d<-read.pure<\$>show n,d>1,mod n d<1] Try it online! Explanation: ...