Search results

• Bitboards
  ...ee.org/document/6783902 Bitboard Connection Code Design for Connect6]''. [[TAAI 2013]] » [[Connect6]] ...n]], [[Shun-Shii Lin]] ('''2019'''). ''A fast nonogram solver that won the TAAI 2017 and ICGA 2018 tournaments''. [[ICGA Journal#41_1|ICGA Journal, Vol. 41
  26 KB (3,485 words) - 18:37, 12 March 2022
• Tournaments and Matches
  ...tp://komodochess.com/store/pages.php?cmsid=17 Komodo handicap matches 2015-2016, various opponents, adjusted handicaps] ...ats-nakamura-in-final-battle-1331 Komodo vs Nakamura, four-game odds match 2016 (2½ - 1½)]
  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
  ...<ref>[http://taai2014.ntust.edu.tw/best-paper-award/ Best Paper Awards | TAAI 2014]</ref> '''2016'''
  137 KB (18,484 words) - 00:18, 19 December 2021
• Proof-Number Search
  ...12391f75d2b964ea7fb6df2 Searching for Stage Proof Number in Connect6]''. [[TAAI 2010]] ...=61774 Proof-number search] by [[Harm Geert Muller]], [[CCC]], October 20, 2016 » [[Crazyhouse]]
  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]] ...th]], ''WCCC 2016: The 22nd World Computer Chess Championship''. » [[WCCC 2016]]
  173 KB (22,418 words) - 20:37, 6 April 2022
• Playing Strength
  ...g|Dragon and Snake on ambos <ref>Photo by [[Gerd Isenberg]], September 18, 2016, detail of the [https://commons.wikimedia.org/wiki/Category:Flottmann-Tor F ...0721 chess statistics scientific article] by Nuno Sousa, [[CCC]], July 06, 2016</ref>
  54 KB (7,310 words) - 11:16, 4 April 2022
• Reinforcement Learning
  '''2016''' * [[Ziyu Wang]], [[Nando de Freitas]], [[Marc Lanctot]] ('''2016'''). ''Dueling Network Architectures for Deep Reinforcement Learning''. [ht
  54 KB (7,025 words) - 12:47, 14 March 2022
• Temporal Difference Learning
  ...g]] ('''2014'''). ''Multi-Stage Temporal Difference Learning for 2048''. [[TAAI 2014]] ...('''2016'''). ''Systematic Selection of N-tuple Networks for 2048''. [[CG 2016]]
  46 KB (6,248 words) - 13:59, 23 May 2021
• Neural Networks
  ...Leach]], [[Koray Kavukcuoglu]], [[Thore Graepel]], [[Demis Hassabis]] ('''2016'''). ''[http://www.nature.com/nature/journal/v529/n7587/full/nature16961.ht ...e: Deep Learning Chess Engine ?] by [[Alexandru Mosoi]], [[CCC]], July 21, 2016</ref>.
  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] * [[Hendrik Baier]], [[Mark Winands]] ('''2016'''). ''Time Management for Monte Carlo Tree Search''. [[IEEE#TOCIAIGAMES|IE
  19 KB (2,702 words) - 21:41, 28 April 2022
• Conferences
  * [[CG 2016]], [https://en.wikipedia.org/wiki/Leiden Leiden], [https://en.wikipedia.org ...ig/gi/gpw/2016/index-e.html 21st Game Programming Workshop], November 4-6, 2016
  34 KB (4,795 words) - 12:50, 7 November 2021
• Shogi
  * [[WCSC26|WCSC26 2016]] * [[19th Computer Olympiad#Shogi|19th Computer Olympiad, Leiden 2016]]
  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
  ...Lee Se-dol], [https://en.wikipedia.org/wiki/BBC_News BBC News], March 12, 2016</ref>. During [[Go#TheFutureofGoSummit|The Future of Go Summit]] from May 2 '''Fine Art''' is a Go playing entity developed since 2016 under the patronage of the Chinese media company [https://en.wikipedia.org/
  97 KB (13,316 words) - 20:49, 18 March 2022
• Hex
  '''2016''' ...nny Young]], [[Ryan Hayward]] ('''2016'''). ''A Reverse Hex Solver''. [[CG 2016]]
  27 KB (3,617 words) - 16:26, 1 December 2021
• Othello
  * [[Wojciech Jaśkowski]], [[Marcin Szubert]] ('''2016'''). ''[https://ieeexplore.ieee.org/document/7180338 Coevolutionary CMA-ES ...ski]], [[Paweł Liskowski]], [[Marcin Szubert]], [[Krzysztof Krawiec]] ('''2016'''). ''[https://content.sciendo.com/view/journals/amcs/26/1/article-p215.xm
  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
• 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 ...Cazenave]] ('''2016'''). ''Fast seed-learning algorithms for games''. [[CG 2016]]
  22 KB (2,874 words) - 12:30, 14 March 2022

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