Strategy-stealing argument

Results: 7



#Item
1On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms Fabien Teytaud and Olivier Teytaud Abstract—Monte-Carlo Tree Search (MCTS) algorithms, including upper confidence Bounds (UCT), have very good

On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms Fabien Teytaud and Olivier Teytaud Abstract—Monte-Carlo Tree Search (MCTS) algorithms, including upper confidence Bounds (UCT), have very good

Add to Reading List

Source URL: game.itu.dk

Language: English - Date: 2010-08-12 04:56:00
2

PDF Document

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-11-23 17:18:40
3Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games Umair Z. Ahmed Krishnendu Chatterjee

Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games Umair Z. Ahmed Krishnendu Chatterjee

Add to Reading List

Source URL: www.cse.iitk.ac.in

Language: English - Date: 2014-11-24 10:14:49
4Evolutionary Game Design Cameron Browne Computational Creativity Group Imperial College London  “Humies” entry

Evolutionary Game Design Cameron Browne Computational Creativity Group Imperial College London “Humies” entry

Add to Reading List

Source URL: www.genetic-programming.org

Language: English - Date: 2012-07-15 23:53:06
5Norman Do How to Win at Tic-Tac-Toe 1

Norman Do How to Win at Tic-Tac-Toe 1

Add to Reading List

Source URL: www.austms.org.au

Language: English - Date: 2005-07-08 01:58:21
6

PDF Document

Add to Reading List

Source URL: www.austms.org.au

Language: English - Date: 2005-07-08 01:58:21
7

PDF Document

Add to Reading List

Source URL: hkumath.hku.hk

Language: English - Date: 2008-04-14 03:38:42