Mark Brockington
Revision as of 13:03, 7 November 2018 by GerdIsenberg (talk | contribs)
Home * People * Mark Brockington
Mark G. Brockington,
a Canadian computer scientist, computer game programmer and Poker player [2]. He received a B.Math. degree in pure mathematics with computer science from the University of Waterloo, in 1992, and graduated at the University of Alberta with a Ph.D. in computer science with a thesis about parallel search, the Asynchronous Parallel Game-Tree Search APHID algorithm [3][4].
The Othello program Keyano was part of his thesis research, and along with Paul Hsieh he co-authored the Othello program QED.
He was affiliated with BioWare developing commercial computer games [5] and led the development of a Poker platform and game engine at Gamesys [6].
Selected Publications
1994
- Mark Brockington (1994). An Implementation of the Young Brothers Wait Concept. Internal report, University of Alberta.
- Mark Brockington (1994). Improvements to Parallel Alpha-Beta Algorithms. Technical report, Department of Computing Science, University of Alberta
1995 ...
- Mark Brockington, Jonathan Schaeffer (1996). The APHID Parallel αβ Search Algorithm. Technical Report 96-07, Department of Computing Science, University of Alberta, pdf from CiteSeerX
- Mark Brockington (1996). A Taxonomy of Parallel Game-Tree Search Algorithms. ICCA Journal, Vol. 19: No. 3
- Yngvi Björnsson, Mark Brockington, Andreas Junghanns, Aske Plaat (1996). Report on the Advances in Computer Chess 8 Conference. ICCA Journal, Vol. 19, No. 3 » Advances in Computer Chess 8
- Andreas Junghanns, Jonathan Schaeffer, Mark Brockington, Yngvi Björnsson, Tony Marsland (1997). Diminishing Returns for Additional Search in Chess. Advances in Computer Chess 8, pdf
- Mark Brockington, Jonathan Schaeffer (1997). APHID Game-Tree Search. Advances in Computer Chess 8
- Mark Brockington (1997). KEYANO Unplugged - The Construction of an Othello Program. Technical Report TR-97-05, Department of Computing Science, University of Alberta
- Mark Brockington (1998). Asynchronous Parallel Game-Tree Search. Ph.D. thesis, University of Alberta, pdf
- Mark Brockington, Jonathan Schaeffer (1999). APHID: Asynchronous Parallel Game-Tree Search. Department of Computing Science, University of Alberta, pdf from CiteSeerX
2000 ...
- Mark Brockington, Jonathan Schaeffer (2000). APHID: Asynchronous Parallel Game-Tree Search. Journal of Parallel and Distributed Computing, Vol. 60, No. 2
- Mark Brockington (2000). Computer Chess Meets Planning. ICGA Journal, Vol. 23, No. 2
External Links
- Mark Brockington | LinkedIn
- Mark Brockington - Faculty of Science - University of Alberta
- Mark Brockington - Bio Page
- APHID Parallel Game-Tree Search Library
- Mark Brockington: Hendon Mob Poker Database
References
- ↑ Mark Brockington | LinkedIn
- ↑ Mark Brockington - Poker Player Profile
- ↑ Mark Brockington (1998). Asynchronous Parallel Game-Tree Search. Ph.D. thesis, University of Alberta
- ↑ APHID Parallel Game-Tree Search Library
- ↑ Mark Brockington from MobyGames
- ↑ Mark Brockington | LinkedIn
- ↑ ICGA Reference Database (pdf)
- ↑ dblp: Mark G. Brockington