Search results

• Bitboards
  ...ee.org/document/6783902 Bitboard Connection Code Design for Connect6]''. [[TAAI 2013]] » [[Connect6]] * [[Cameron Browne]] ('''2014'''). ''Bitboard Methods for Games''. [[ICGA Journal#37_2|ICGA Journal, Vol.
  26 KB (3,485 words) - 18:37, 12 March 2022
• Tournaments and Matches
  * [[Stockfish#Matches|GM+Rybka vs. Stockfish 2014]] * [[TAAI]]
  9 KB (1,042 words) - 14:09, 11 October 2023
• Monte-Carlo Tree Search
  ...''Time Management for Monte-Carlo Tree Search Applied to the Game of Go''. TAAI 2010, [http://remi.coulom.free.fr/Publications/TimeManagement.pdf pdf] ...''2013'''). ''Strategic Choices: Small Budgets and Simple Regret''. [[TAAI|TAAI 2012]], [http://www.csie.ndhu.edu.tw/csieweb/en/node/685 Excellent Paper Aw
  76 KB (10,188 words) - 16:36, 1 December 2021
• Learning
  * [[Ryszard Michalski]], [[Jaime Carbonell]], [[Tom Mitchell]] ('''1985, 2014'''). ''[https://www.elsevier.com/books/machine-learning/michalski/978-0-08- * [[Yves Kodratoff]], [[Ryszard Michalski]] ('''1990, 2014'''). ''[https://www.elsevier.com/books/machine-learning/kodratoff/978-0-08-
  137 KB (18,484 words) - 00:18, 19 December 2021
• Proof-Number Search
  ...12391f75d2b964ea7fb6df2 Searching for Stage Proof Number in Connect6]''. [[TAAI 2010]] * [[Mark Watkins]] ('''2014'''). ''Solved Openings in Losing Chess''. [[ICGA Journal#37_2|ICGA Journal,
  32 KB (4,387 words) - 22:29, 17 June 2021
• ICGA Journal
  * [[Yen-Chi Chen]], [[Shun-Shii Lin]], ''A fast nonogram solver that won the TAAI 2017 and ICGA 2018 tournaments''. » [[Bitboards]], [[Nonogram]] ==Volume 37, 2014==
  173 KB (22,418 words) - 20:37, 6 April 2022
• Playing Strength
  ...g systems of humans and engines] by [[Erik Varend]], [[CCC]], December 06, 2014</ref> <ref>[http://www.talkchess.com/forum/viewtopic.php?t=60721 chess stat ...of Indicators for Estimating Players’ Strength by using Computer Go''. [[TAAI 2018]]
  54 KB (7,310 words) - 11:16, 4 April 2022
• Reinforcement Learning
  '''2014''' * [[Marcin Szubert]] ('''2014'''). ''Coevolutionary Shaping for Reinforcement Learning''. Ph.D. thesis, [
  54 KB (7,025 words) - 12:47, 14 March 2022
• Temporal Difference Learning
  ...'''2014'''). ''Multi-Stage Temporal Difference Learning for 2048''. [[TAAI 2014]] ...rence Learning on Othello''. [http://www.evostar.org/2014/ EvoApplications 2014], [http://www.springer.com/computer/theoretical+computer+science/book/978-3
  46 KB (6,248 words) - 13:59, 23 May 2021
• Neural Networks
  ...opagation.html Who Invented Backpropagation?] by [[Jürgen Schmidhuber]] (2014, 2015)</ref>. ...ubeck]], [https://blogs.princeton.edu/imabandit/ I’m a bandit], March 6, 2014</ref> <ref>[https://blogs.princeton.edu/imabandit/2015/06/30/revisiting-nes
  156 KB (21,084 words) - 18:34, 12 March 2022
• Time Management
  ...''Time Management for Monte-Carlo Tree Search Applied to the Game of Go''. TAAI 2010, [http://remi.coulom.free.fr/Publications/TimeManagement.pdf pdf] '''2014'''
  19 KB (2,702 words) - 21:41, 28 April 2022
• Conferences
  * [[ECAI CGW 2014]], [https://en.wikipedia.org/wiki/Prague Prague], [https://en.wikipedia.org ...ig/gi/gpw/2014/index-e.html 19th Game Programming Workshop], November 7-9, 2014
  34 KB (4,795 words) - 12:50, 7 November 2021
• Shogi
  * [[WCSC24|WCSC24 2014]] '''2014'''
  37 KB (4,824 words) - 16:19, 1 December 2021
• Connect6
  ...12391f75d2b964ea7fb6df2 Searching for Stage Proof Number in Connect6]''. [[TAAI 2010]] ...ee.org/document/6783902 Bitboard Connection Code Design for Connect6]''. [[TAAI 2013]]
  11 KB (1,475 words) - 15:33, 29 June 2020
• Go
  ...uter-go.org/pipermail/computer-go/ The Computer-go Archives], December 19, 2014</ref>. ...''Time Management for Monte-Carlo Tree Search Applied to the Game of Go''. TAAI 2010, [http://remi.coulom.free.fr/Publications/TimeManagement.pdf pdf]
  97 KB (13,316 words) - 20:49, 18 March 2022
• Othello
  ...Solving 6x6 Othello on Volunteer Computing System''. [[Conferences#GPW|GPW-2014]]</ref> are [https://en.wikipedia.org/wiki/Computer_Othello#Solving_Othello '''2014'''
  36 KB (5,000 words) - 01:08, 8 December 2020
• Chinese Dark Chess
  | [[TAAI 2010]] | [[TAAI 2011]]
  7 KB (851 words) - 15:37, 29 June 2020
• Nonogram
  ...am puzzle <ref>[[Lung-Pin Chen]], [[Der-Johng Sun]], [[Wen-Jie Tseng]] ('''2014'''). ''Nonogram Tournament in Olympiad Yokohama 2013''. [[ICGA Journal#37_1 [[Computer Olympiad]], [[TAAI]], and [[TCGA]] hold Nonogram competitions since 2010.
  6 KB (681 words) - 16:35, 1 December 2021
• I-Chen Wu
  ...A Journal, Vol. 34, No. 1]] <ref>[http://aigames.nctu.edu.tw/TAAI2011/eng/ TAAI Computer Game Tournaments]</ref> ...1''. [[ICGA Journal#35_2|ICGA Journal, Vol. 35, No. 2]] » [[Nonogram]], [[TAAI 2011]]
  19 KB (2,462 words) - 19:19, 4 April 2022
• Tristan Cazenave
  ...'''). ''UCD : Upper Confidence bound for rooted Directed acyclic graphs''. TAAI IWCG, [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/taai2010-final.pdf '''2014'''
  22 KB (2,874 words) - 12:30, 14 March 2022

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)