Mark G. Brockington

According to our database, Mark G. Brockington authored at least 5 papers between 1996 and 2000.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2000

APHID: Asynchronous Parallel Game-Tree Search.

Mark G. Brockington, Jonathan Schaeffer

J. Parallel Distributed Comput., 2000

Computer Chess Meets Planning.

Mark G. Brockington

J. Int. Comput. Games Assoc., 2000

1996

A Taxonomy of Parallel Game-Tree Search Algorithms.

Mark G. Brockington

J. Int. Comput. Games Assoc., 1996

Report on the Advances in Computer Chess 8 Conference.

Yngvi Björnsson, Mark G. Brockington, Andreas Junghanns, Aske Plaat

J. Int. Comput. Games Assoc., 1996

The APHID parallel αβ search algorithm.

Mark G. Brockington, Jonathan Schaeffer

Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996