Gomboc, David, Buro, M. and T.A. Marsland: Tuning Evaluation Functions by Maximizing Concordance, Theoretical Computer Science, Vol 349(2), pp. 202-229, Elsevier, 2005.
Gomboc, D., Marsland, T.A. and M. Buro: Evaluation Function Tuning via Ordinal Correlation, Procs. 10th Intl. Conf. on Advances in Computer Games, Graz, Austria, pp 1-18, 24-27 Nov. 2003.
Kopec, D., Cox D.L. and T.A. Marsland: Chapter 63: Search. In The Computer Science and Engineering Handbook, 2nd Edition, Allen B. Tucker (editor), CRC Press, 2004, 63-1 to 63-26.
Bjornsson, Y. and T.A. Marsland: Learning Extension Parameters in Game-Tree Search, (draft in press) Information Sciences Journal, Vol. 154, Issues 3-4, Elsevier, Sept. 2003: 95-118.
Bjornsson, Y. and T.A. Marsland: Learning Control of Search Extensions, Procs. 6th Joint Conf. on Information Sciences, Research Triangle Park NC, (March 2002): 446-449.
Computers and Games, Springer LNCS 2063, edited by Tony Marsland and Ian Frank, 2001: 443 pages. ISBN 3-540-43060-6
Bjornsson, Y. and T.A. Marsland: Multi-cut Alpha-beta Pruning in Game-tree Search. Theoretical Computer Science 252 Nos. 1-2 (February 2001): 177-196.
Marsland, T.A. and Y. Bjornsson (2000): Variable-depth search. In Advances in Computer Games 9, Editors van den Herik and Monien. University of Maastricht: 5-20. ISBN 90-621-6576-1.
Bjornsson, Y. and T.A. Marsland (2000): Learning Search Control in Adversary Games. In Advances in Computer Games 9, Editors van den Herik and Monien. University of Maastricht: 147-164. ISBN 90-621-6576-1.
Bjornsson, Y. and T.A. Marsland: Risk Management in Game-tree Pruning. Information Sciences Journal 122 No. 1 (January 2000): 23-41.
Marsland, T.A. and Y. Bjornsson: From Minimax to Manhattan. In Games in AI Research, Editors van den Herik and Iida. University of Maastricht and Shizuoka University (2000): 5-17. ISBN 90-621-6416-1.
Bjornsson, Y. and T.A. Marsland: Selective Depth-first Search Methods. (July 1997 draft version). In Games in AI Research, Editors van den Herik and Iida. University of Maastricht and Shizuoka University (2000): 31-46. ISBN 90-621-6416-1.
Bjornsson, Yngvi, T.A. Marsland, J. Schaeffer and A. Junghanns: Searching with Uncertainty Cut-offs. In Advances in Computer Chess 8, H.J van den Herik (editor), 1997, 167-179.
Junghanns, Andreas, Jonathan Schaeffer, Mark Brockington, Yngvi Bjornsson and Tony Marsland: Diminishing Returns for Additional Search in Chess. In Advances in Computer Chess 8, H.J van den Herik (editor), 1997, 53-67.
Kopec, D. and T.A. Marsland: Chapter 30: Search. In The Computer Science and Engineering Handbook, Allen B. Tucker (editor), CRC Press, 1997, 676-696.
Marsland, T.A.: The Anatomy of Chess Programs. In collected papers from AAAI workshop, report WS-97-04, AAAI Press, 24-26. ISBN 1-57735-031-6.
Marsland, Tony & Yngvi Bjornsson: From MiniMax to Manhattan, In AAAI Technical Report WS-97-04, 1997, 31-36.
Report of the first Kasparov vs. Deep Blue Match See also The Canadian Encyclopedia.
Marsland, T.A.: Experience is a Hard Teacher, ICCA Journal, December 1996.
Gao, Y. and T.A. Marsland: Multithreaded Pruned Tree Search in Distributed Systems. Presented at 8th Intl. Conf. on Computing and Information, Waterloo, June, 1996. Journal of Computing and Information, 2(1), 1996, 482-492.
Marsland, T.A.: The Future of Computer Chess, ICCA Journal, 19(1), March 1996, 35-36.
Reinefeld, A. and T.A. Marsland: Enhanced Iterative-deepening Search, IEEE Trans. on PAMI, 16(6), 1994, 701-710.
Yang, Zhonghua and T.A. Marsland: Distributed Debugging in the Large, Australian Computer Science Com., 16(1), January 1994, 75-82.
Global States and Time in Distributed Systems, edited by Z. Yang and T.A. Marsland, IEEE Press, Los Alamitos, CA, November 1993, 168 page, ISBN 0-8186-5300-0.
Yang, Z. and T.A. Marsland: Annotated Bibliography on Global States and Times in Distributed Systems, Operating Systems Review, vol. 27, #3, July 1993, 55-74.
Marsland, T.A.: Computer Chess and Search. In Encyclopedia of Artificial Intelligence, S. Shapiro (editor), J. Wiley & Sons, 2nd edition, 1992, 224-241.
Marsland, T.A.: Game-Tree and Single-Agent Search. In Encyclopedia of Computer Science and Technology, A. Kent and J.G. Williams (editors), 1992, 317-336.
Yang, Z. and T.A. Marsland: Global Snapshots for Distributed Debugging, Procs. IEEE 4th Intl. Conf. on Comp. and Info., ICCI'92, May 1992, 409-413.
Ye, Chun and T.A. Marsland, Experiments in Forward Pruning with Limited Extensions, ICCA Journal, Vol. 15, No. 2, 1992, 55-66.
Ye, Chun and T.A. Marsland: Selective Extensions in Game-Tree Search. In Heuristic Programming in Artificial Intelligence 3, H.J. van den Herik and L.V. Allis (eds), Ellis Horwood, Chichester, UK, 1992, 112-122.
Levinson R., Hsu, F., Marsland T., Schaeffer J. and Wilkins, D.: The Role of Chess in Artificial Intelligence Research Panel Discussion, Procs. IJCAI 1991, pp 547-552. See also ICCA Journal, Vol. 14, No. 3, pp. 153-161.
Marsland, T.A., T. Breitkreutz and S. Sutphen:
A Network Multiprocessor for Experiments in Parallelism,
Concurrency: Practice and Experience, 3(3), June 1991, 203-219.
Miscellaneous Technical Reports
Less formal works, including some Workshop documents and ICCA Correspondence.