JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for META-HEURISTICS Archives


META-HEURISTICS Archives

META-HEURISTICS Archives


META-HEURISTICS@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

META-HEURISTICS Home

META-HEURISTICS Home

META-HEURISTICS  June 2010

META-HEURISTICS June 2010

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

EPSRC PhD Studentship in Monte Carlo Tree Search

From:

Peter Cowling <[log in to unmask]>

Reply-To:

Peter Cowling <[log in to unmask]>

Date:

Tue, 8 Jun 2010 15:00:43 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (28 lines)

EPSRC PhD Studentship in Artificial Intelligence Monte Carlo Tree Search in Uncertain Environments - Application to the Magic:The Gathering Card Game

University of Bradford:  School of Computing, Informatics and Media.
Supervisor: Professor Peter Cowling (www.scim.brad.ac.uk/~picowlin). 
Financial Information: This studentship will pay PhD fees (UK/EU or worldwide) and a tax-free stipend of  £13,290 per annum, for a period of 3 years.
Start Date: 1st October 2010 (or later by agreement).

Background: The desire for better Artificial Intelligence (AI) in board games, card games and, more recently, video games have been a constant driver for AI research. There is considerable current excitement over the potential of Monte Carlo Tree Search algorithms (particularly UCT (http://senseis.xmp.net/?UCT)), which have produced professional-level computer Go players in the past year, a significant step towards addressing one of the major outstanding research questions of Artificial Intelligence (http://oase.nutn.edu.tw/FUZZ_IEEE_2009/result.htm). We have received substantial funding from EPSRC to investigate the full potential of Monte Carlo Tree Search (see http://gow.epsrc.ac.uk/ViewGrant.aspx?GrantRef=EP/H049061/1), in a collaboration between the University of Bradford,  Imperial College London, the University of Essex, the University of Reykjavik (Iceland), AI Factory Ltd., Introversion Software Ltd. and Nestorgames Ltd. 

Project: For the majority of problems where game/decision tree models are appropriate, particularly real-time video games and industrial decision problems, the tree is nondeterministic, with both hidden information and randomness. This PhD project will investigate Monte Carlo Tree Search in a situation of hidden information and randomness, focussing specifically on one of the most popular card games in the world, Magic: The Gathering (www.magicthegathering.com). The student will investigate how to design AI to handle uncertainty in card draws and opponent plays, and the hidden information of the opponent's cards in hand, using Monte Carlo Tree Search, starting from simple sets of cards and increasing in complexity to deal with the fact that many of the rules of Magic:The Gathering are only introduced as cards are played (making Magic in some sense an exercise in General Game Playing (see http://games.stanford.edu/)).

The PhD student: The PhD student will work closely with Prof Peter Cowling and a post-doctoral research assistant (to be appointed), as well as another PhD student already in post, to read and synthesise research papers, design algorithms, write computer codes, conduct experiments, present their work to other consortium members and at international scientific conferences, and write high-quality journal and conference papers.
   Good programming skills are required, preferably in a range of languages including C# or C++, as well as good training (and preferably research/project experience and publications) in artificial intelligence, discrete mathematics and the design of algorithms and data structures. An enthusiasm for games and a knowledge of game tree search is desirable. Knowledge of parallel programming techniques is also desirable.

The University, School and City:  The School of Computing Informatics and Media at the University of Bradford has a strong research focus, as evidenced by our population of over 100 PhD students and the fact that 45% of our research was rated "Internationally Leading" or "World Class" by the 2008 Research Assessment Exercise. In 2010, all research staff and students were relocated to purpose-built facilities within the University's city-centre campus. One of the UK's largest cities, set amongst some of the most spectacular countryside in England and yet one of the most affordable places to live in Britain, Bradford's wonderful paradoxes create a student city that is hard to beat. Bradford also has excellent transport links via Leeds/Bradford airport to London, Europe and the rest of the world, and via excellent UK road and rail connections.

General Information
Eligibility:  This studentship is open to all nationalities (UK/EU and worldwide) Academic Requirements: A First class or 2.1 honours degree or equivalent in a scientific discipline with substantial experience of discrete mathematics and programming.
English Language Requirements: Candidates whose first language is not English need to have IELTS 7.0 or equivalent.
Start Date: 1 October 2010 (or later by agreement).
Duration: 3 years
For informal enquiries: Contact Prof Peter Cowling (email: [log in to unmask], tel.: +44 (0) 1274 234005).
To Apply: The following documents should be sent in a single email to Prof Peter Cowling ([log in to unmask]) before the application deadline (7th July 2010):
-	Covering statement (500 words maximum) outlining your suitability and motivation for the PhD position.
-	Academic CV including marks transcript.
-	Two academic references.
-	Evidence of English language ability for candidates whose first language is not English (IELTS 7.0 or equivalent).

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager