Pre-searching: http://webdocs.cs.ualberta.ca/~jonathan ... Search.pdf
The idea is: at ply D, you run across position X at depth Y, but you "expect" to run across it again (at the same ply) at depth Z, where Z is bigger than Y. So you search to depth Z in the first place.
Imperfect Information Endgame Databases: http://webdocs.cs.ualberta.ca/~jonathan ... tialDB.pdf
Building checkers databases w/o having to have the recursive promotion DBs built, relying instead on partial information. So they could work with 6c vs 5c w/o having the 6 king versus 5 king built.
Automatic Generation of Search Engines: http://webdocs.cs.ualberta.ca/~jonathan ... GPilot.pdf
Some ideas toward automated advances to surpass alpha-beta.
Rediscovering *-Minimax Search: http://webdocs.cs.ualberta.ca/~jonathan ... 04smm1.pdf
Building the Checkers 10-piece Endgame Databases: http://webdocs.cs.ualberta.ca/~jonathan ... ases10.pdf
The paper that describes various techniques with bitbases.
Search Ideas in Chinook: http://webdocs.cs.ualberta.ca/~jonathan ... chideas.ps
One idea that appears here: in aspiration search, on fail-low at root, use a sort of IID (reduce ply back to 1). Then again, Chinook rarely fails low.
![Smile :)](./images/smilies/icon_e_smile.gif)
Some of these later ones have problems with the Figures in the Postscript files.
Diminishing Returns for Additional Search in Chess: http://webdocs.cs.ualberta.ca/~jonathan ... ers/dim.ps
Somewhat of a precursor to "Crafty goes deep" I guess.
New Advances in Alpha-Beta Searching: http://webdocs.cs.ualberta.ca/~jonathan ... m-final.ps
New as in 1996. He has many papers from the mid-90s about alternatives for minimax trees. See for instance: http://webdocs.cs.ualberta.ca/~jonathan ... .1994.html
Solving Large Retrograde Analysis Problems Using a Network of Workstations: http://webdocs.cs.ualberta.ca/~jonathan ... tabases.ps
The Game of Chess: http://webdocs.cs.ualberta.ca/~jonathan ... s/simon.ps
A brief overview written with Simon in 1989.
Checkers: A Preview of What Will Happen in Chess? http://webdocs.cs.ualberta.ca/~jonathan ... preview.ps
Empirical Results with Conspiracy Numbers: http://webdocs.cs.ualberta.ca/~jonathan ... s/compi.ps
See section 6 for the experimental results with Phoenix.
Chunking for Experience: http://webdocs.cs.ualberta.ca/~jonathan ... rs/mach.ps
Trying to do something with pattern recognition in Phoenix.
The History Heuristic and the Performance of Alpha-Beta Enhancements: http://webdocs.cs.ualberta.ca/~jonathan ... rs/pami.ps