If you attempt to quantify the “power” of an optimisation process—without any attempt to factor in the number of evaluations required, the time taken, or the resources used—the “best” algorithm is usually an exhaustive search.
Current theme: default
Less Wrong (text)
Less Wrong (link)
Arrow keys: Next/previous image
Escape or click: Hide zoomed image
Space bar: Reset image size & position
Scroll to zoom in/out
(When zoomed in, drag to pan; double-click to close)
Keys shown in yellow (e.g., ]) are accesskeys, and require a browser-specific modifier key (or keys).
]
Keys shown in grey (e.g., ?) do not require any modifier keys.
?
Esc
h
f
a
m
v
c
r
q
t
u
o
,
.
/
s
n
e
;
Enter
[
\
k
i
l
=
-
0
′
1
2
3
4
5
6
7
8
9
→
↓
←
↑
Space
x
z
`
g
If you attempt to quantify the “power” of an optimisation process—without any attempt to factor in the number of evaluations required, the time taken, or the resources used—the “best” algorithm is usually an exhaustive search.