Grant: Discovery Grants Program - Individual
University of Alberta
$22,000.00
Computational Intelligence and Computer Search
FY 2019-20
Summary
For centuries, games such as chess and Go have served as an arena in which humans showed their intellectual strength. Today, such games serve as an arena in which machines show their computational intelligence. A key aspect of computational intelligence is search.***The goal of this project is to find improved search algorithms. A typical problem is to find the next move in a two-player game such as chess or Go. Here, the algorithm must search a large space of possible continuations of the game and select a move which will turn out to be strong. Historically, the problem of building strong artificial players for games such as chess or Go has been a main challenge in the field of artificial intelligence.***Recently, there has been tremendous progress in this field. Around 10 years ago, a new search algorithm --- Monte Carlo Tree Search (MCTS) --- that combines classical tree-search techniques with random move sampling revolutionized computer Go. I plan to continue work on fundamental problems that both explain the success of MCTS and lead to improvements for it. More recently, another algorithm --- Deep Learning --- has emerged that promises another such revolution. I plan to work on this as well.**
Program
Discovery Grants Program - Individual
Recipient
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2016-04601
Name nom
Hayward, Ryan
Department département
Computing Science
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2019
Competition year année de concours
2016
Award amount
22000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Installment
inst:4 - 5
Partie
4
Nb partie
5
Application title
Computational Intelligence and Computer Search
Keyword
NSERC
Application summary
For centuries, games such as chess and Go have served as an arena in which humans showed their intellectual strength. Today, such games serve as an arena in which machines show their computational intelligence. A key aspect of computational intelligence is search.***The goal of this project is to find improved search algorithms. A typical problem is to find the next move in a two-player game such as chess or Go. Here, the algorithm must search a large space of possible continuations of the game and select a move which will turn out to be strong. Historically, the problem of building strong artificial players for games such as chess or Go has been a main challenge in the field of artificial intelligence.***Recently, there has been tremendous progress in this field. Around 10 years ago, a new search algorithm --- Monte Carlo Tree Search (MCTS) --- that combines classical tree-search techniques with random move sampling revolutionized computer Go. I plan to continue work on fundamental problems that both explain the success of MCTS and lead to improvements for it. More recently, another algorithm --- Deep Learning --- has emerged that promises another such revolution. I plan to work on this as well.**