Bleicher, E. (2004). Building chess endgame databases for positions with many pieces using a-priori infor-mation. http://www.minet.uni-jena.de/preprints/bleicher_04/FREEZER_.PDF.
Bleicher, E. (2012). http://www.k4it.de/index.php?topic=egtb&lang=en Nalimov EGT look-up service.
Bourzutschky, M. and Konoval, Y. (2011a). News in Endgame Databases. EG, Vol. 17, No. 185, pp. 220-229.
Bourzutschky, M. and Konoval, Y. (2011b). News in Endgame Databases (II). EG, Vol. 17, No. 186, pp. 321-330. ISSN 0012-7671.
Bourzutschky, M. and Konoval, Y. (2012). News in Endgame Databases part 3. EG, Vol. 18, No. 188, pp. 122-131. ISSN 0012-7671.
Bryant, J. D. (2012). http://www.youtube.com/watch?v=2h_b0puS8Vk KBPPKNP position analysis.
ChessOK (2012). http://chessok.com/?page_id=361 Online access to sub-7-man Nalimov EGTs.
Haworth, G. McC. (2000). Strategies for Constrained Optimisation. ICGA Journal, Vol. 23, No. 1, pp. 9-20.
Haworth, G. McC. (2011). Chess Endgame News. ICGA Journal, Vol. 34, No. 2, p. 89.
Haworth, G. McC. and Rusz, A. (2011). Position Criticality in Chess Endgames. In: Advances in Computer Games 13, ACG 2011. LNCS 7168, Springer. ISBN 978-3-642-31865-8.
HPC (2012). http://www.top500.org/list/2012/06/100 The Top 500 list.
Hurd, J. and Haworth, G.McC. (2010). Data Assurance in Opaque Computations. Advances in Computer Games 12, pp. 221-231. ISBN 978-3-642-12992-6.
MVL team (2012). https://plus.google.com/100454521496393505718/posts, esp. 2012-04-06 about the team.
Romero, P. P. (2012). http://www.mtu-media.com/finalgen FINALGEN: download, tutorial and examples.
Rusz, A. (2012). http://talkchess.com/forum/viewtopic.php?t=44544 KBPPKNP Vital Zug conjecture.
Schaeffer, J., Björnsson, Y., Burch, N., Lake, R., Lu, P., Sutphen, S. (2003). Building the Checkers 10-piece Endgame Databases. In: Advances in Computer Games 10, pp. 193-210. Springer, ISBN 978-1-4020-7709-8.
van der Heijden, H.M.J.F. (2010). http://www.hhdbiv.nl/. HHDBIV, ENDGAME STUDY DATABASE IV.
Vlasák, E. (2012) 7-man alternatives. EG, Vol. 18, No. 189, pp. 214-218. ISSN 0012-7671.