Fraenkel, Aviezri S.; Garey, M. R.; Johnson, David S.; Yesha, Yaacov (1978). "The complexity of checkers on an N × N board". 19th Annual Symposium on Foundations of Computer Science. pp.55–64. doi:10.1109/SFCS.1978.36.
Robson, J. M. (May 1984). "N by N Checkers is EXPTIME complete". SIAM Journal on Computing. 13 (2): 252–267. doi:10.1137/0213018.
Angerstein, Wolfgang. Board Game Studies: Das Säulenspiel Laska: Renaissance einer fast vergessenen Dame-Variante mit Verbindungen zum Schach. Vol. 5, CNWS Publications, 2002, pp. 79-99, bgsj.ludus-opuscula.org/PDF_Files/BGS5-complete.pdf.Archived 2 June 2016 at the Wayback Machine. Accessed 16 Dec. 2021.
Peck, Harry Thurston (1898). "Latruncŭli". Harpers Dictionary of Classical Antiquities. New York: Harper and Brothers. Archived from the original on 8 October 2008. Retrieved 7 August 2021.
Peck, Harry Thurston (1898). "Latruncŭli". Harpers Dictionary of Classical Antiquities. New York: Harper and Brothers. Archived from the original on 8 October 2008. Retrieved 7 August 2021.
Tapalnitski, Aleh (2019). Meet Dameo(PDF). Archived(PDF) from the original on 21 October 2020.
Angerstein, Wolfgang. Board Game Studies: Das Säulenspiel Laska: Renaissance einer fast vergessenen Dame-Variante mit Verbindungen zum Schach. Vol. 5, CNWS Publications, 2002, pp. 79-99, bgsj.ludus-opuscula.org/PDF_Files/BGS5-complete.pdf.Archived 2 June 2016 at the Wayback Machine. Accessed 16 Dec. 2021.