some fiddling with README; note MSIE5.5 compat
Fix query string example: RST didn't cope with %20 spaces
README: consistent non-capitalisation of p4wn

Lower case, except when starting a sentence. Capitalised looks
unbalanced with that giat 4 in there.
README: describe state methods rather than p4_* functions
README: consistent markup of filenames (monospace)
MSIE compat: a previously missed use of currentTarget
Allow limited localisation of notation on game logs
add example/test of two boards and localised game log
Add an undo button, with documentation
p4_parse search piece list backwards, putting recently moved first

Moved pieces get appended on the end of the pieces list.  Alpha-beta
searches are faster if the best moves are tried early on, and the best
move is (by this hypothesis) likely to involve a recently moved piece.

Approximately 2-fold speed increase on the benchmark board, but less
on others.  At the beginning the hypothesis is clearly wrong, where
good play involves getting all your pieces out, not bouncing one piece
around.
Tune and fix weights

"Fix" refers to

 - if (x == 4 || x == 5);{
 + if (x == 4 || x == 5){
Fix rook weights: hate the square, not the column

The rooks were being discouraged from the entire side column, not just
from their square.

Also they tended to just jump one sideways, rather pointlessly.  So
discourage that too, and bump up the centralising weight.
Weights overlay: show negative weights in a purplish colour
Reorder pieces to reorder movelists

The move list is constructed by finding the moves of each piece in
(reverse) order.  If the pieces list is well arranged, the best moves
will be found first, making alpha-beta derived searches much faster.

This first iteration orders the pieces by their best weighted moves --
that is it puts capturers first, in the order of the pieces they
capture, then other pieces in the order of the weight of their moves.

Captures already go first, of course; this promotes the other moves of
the catpuriong piece.

It does nothing to the default benchmark, but doubles the speed of the
initial position -- presumably because move quality there is all about
positional weights.
shift an interesting speed benchmark up the fen list
Add an aggregate benchmark using several different board positions

They are just a haphazard selection of the already haphazardly
collected positions.  The ply depth for each is manually selected to
finish in sub-second time.
Optimise piece list by weights and threats, not captures

Captures are already dragged to the front of the queue, so to consider
them here is detrimental -- they would pull forward their piece's
meritless other moves.

This gives about a 940 -> 860 speed up on firefox; 330 -> 310 on
chromium.
Adjust piece list optimiser: threat is scalar

This is slightly faster in chrome.
Drop piece huffling option: optimiser does it better

The shuffler was added to prevent systematic bias toward one corner of
the board.  But it never did anything noticable except make
benchmarking impossible.  Now the piece optimiser shuffles the pieces
reasonably well anyway.
Auto-test: add more failing parse tests

From http://chessprogramming.wikispaces.com/Perft+Results

No idea what's wrong.