Martin Müller
	Professor Office:   345 Athabasca Phone:   1 - 780 - 492 3703 Fax (CS dept.):   1 - 780 - 492 1071 Email (in domain ualberta.ca): mmueller

News and Announcements

• Upcoming visitor February 22 - March 19: Akihiro Kishimoto, Assistant Professor, Tokyo Institute of Technology, a graduate from our dept.
• Jan 14: The shogi program Bonkras (which stands for Bonanza cluster) beat the former top professional Yonenaga in an official match. Also see the Japan Times report, or replay the game (Bonkras moves first and its pieces are at the lower side of the board).
• Jan 13-18: John Tromp is playing computer Go program Zen in a best of five match.
• Visitor January 12 to February 24: Kunihito Hoki, Assistant Professor at the University of Electro-Communications in Tokyo, author of the leading shogi program Bonanza, and inventor of the "Bonanza method" for parameter tuning which is used in all strong shogi programs now.
• Dec 6: It's official: Our team Alberta Black is going to the ACM ICPC World Finals in Warsaw, Poland!
• Dec 6: teaching next term: Cmput 403 - Practical Algorithmics.
• Dec 6: Some pages on NoGo.
• Dec 6: The Go program Erica, written by our Postdoc Aja Huang, made it to the final game of the 5th UEC cup! Zen won the event. Things did not go well for Fuego this year, with one game lost by network problems and another by an operator error.
• Nov 18-26: Lots of medals for UofA programs at the Olympiad! Gold in Hex, Havannah and NoGo. Silver in Hex and NoGo. Bronze in 9x9 Go and Amazons. Fuego also took 4th in 13x13 Go and 5th in 19x19.
• Nov 12: Getting ready for the Computer Olympiad in Tilburg, Netherlands. UofA will have entries for Hex, Go, Havannah, Amazons, and NoGo.
• Nov 12: At the 2011 TAAI computer Go competitions, Fuego takes second place behind Zen in all three events: 9x9, 13x13 and 19x19. See blog entries for the first day and second day.
• Older news (Oct 2011 and before)

Coaching and Outreach

• Coaching our Programming Club. We meet Fridays at 3pm in the Algorithmics Lab CSC 217. Come join the team, and maybe you can go to the ACM-ICPC world finals too!
• Computing science in high schools, especially the Iverson Exam

Research

• Game-tree search and two-player games, including:
  • Computer Go
  • Computer Amazons
  • NoGo
  • Monte Carlo Tree Search, including parallel search.
  • Efficient search methods for Depth-first Proof Number Search and solving the Graph History Interaction (GHI) Problem.
  • Combinatorial game theory, especially efficient algorithms that combine search and subgame decomposition.
• Fully automated planning, recently focusing on Monte Carlo random walk methods and parallel search.
• More research.

More Information

• Group Members, current and previous
• Publications of my research group
• Courses
• Official faculty page
• Career
• Other Things