Search results

Jump to: navigation, search
  • ...ammad ibn Mūsā al-Khwārizmī]] <ref>A stamp issued September 6, 1983 in the [https://en.wikipedia.org/wiki/Soviet_Union Soviet Union]], commemorating [ ...ww.mpi-inf.mpg.de/%7Emehlhorn/Toolbox.html Data Structures and Algorithms: The Basic Toolbox]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusines
    22 KB (2,849 words) - 10:34, 5 April 2021
  • ...erg]] ('''1992'''). ''The 7th World Computer-Chess Championship. Report on the Tournament''. [[ICGA Journal#15_4|ICCA Journal, Vol. 15, No. 4]]</ref> . ...Spracklen]] played their last tournament, after losing the finish against the ChessMachine. [[Hans Berliner|Berliner's]] [[HiTech]] used [[B*]].
    24 KB (3,124 words) - 11:29, 28 January 2020
  • ...g <ref>A depiction of the world's oldest continually operating university, the [https://en.wikipedia.org/wiki/University_of_Bologna University of Bologna] ...evolution], as further mentioned in [[Automated Tuning|automated tuning]]. The process of learning often implies [https://en.wikipedia.org/wiki/Understand
    137 KB (18,484 words) - 00:18, 19 December 2021
  • ...lso specify a [[Captures|captured]] piece, if any, for the purpose to make the notation reversible, and to go backward as easy as forward while re-playing ...ite halfmove, followed by a the black reply, often in a second column of a grid view. If a move notation starts with Black, also after embedded comments or
    19 KB (2,798 words) - 14:04, 3 December 2021
  • ...mon ones. As soon as the program is "out of book" it has to continue using the normal search routines. ...he beginning and look through all possible continuations in detail to find the best next move, but as this is quite time-consuming. In contrast, opening b
    33 KB (4,574 words) - 04:04, 11 September 2021
  • ...aphical [[Chessboard|board]] and [[Chess Game|game]] representation, where the user may [[Entering Moves|enter moves]] by [https://en.wikipedia.org/wiki/P ....wikipedia.org/wiki/IEEE_Annals_of_the_History_of_Computing IEEE Annals of the History of Computing], Vol. 20, No. 2</ref>
    21 KB (3,097 words) - 04:02, 7 June 2022
  • ...ration exploration]" to get more information about the expected payoffs of the other machines - is also faced in reinforcement learning. ...ia.org/wiki/Nature_%28journal%29 Nature], Vol. 518</ref>, soon followed by the spectacular [[AlphaGo]] and [[AlphaZero]] breakthroughs.
    54 KB (7,025 words) - 12:47, 14 March 2022
  • ...wiki/Axon_hillock axon hillock] and transmits this electrical signal along the [https://en.wikipedia.org/wiki/Axon axon]. ...whose dot-product activates or controls the post-synaptic output, which is the base of Neural network learning <ref>[https://en.wikipedia.org/wiki/Biologi
    156 KB (21,084 words) - 18:34, 12 March 2022
  • ...o connect the opposing sides of own colors with own stones - or to prevent the opponent from doing so, by alternately placing stones on a single cell. ...rg/wiki/Parker_Brothers Parker Brothers] marketed a version called Hex and the name stuck <ref>[http://www.hexwiki.org/index.php?title=History_of_Hex Hist
    27 KB (3,617 words) - 16:26, 1 December 2021
  • ...in each row or column matches the corresponding row clue and column clue. The clues or numbers are a form of [https://en.wikipedia.org/wiki/Discrete_tomo Since 2011, the competition format changed from tournament to solver speed competition.
    6 KB (681 words) - 16:35, 1 December 2021
  • ...Bochum Chinese Garden] [https://www.ruhr-uni-bochum.de/cgev/ Qian Yuan] of the [https://en.wikipedia.org/wiki/Botanical_Garden_of_Ruhr_University_Bochum B ...) and 9 vertical lines [[Files|(files]]) with total of 90 points or cells. The board can use almost all board representations of chess such as Piece Centr
    1 KB (180 words) - 10:27, 5 February 2021
  • .... [https://arxiv.org/abs/cs/0210020 arXiv:cs/0210020]</ref>, and maintains the ''How to Construct Tetris Configurations'' site <ref>[http://liacs.leidenu ...series of highly local reasoning steps regarding single rows and columns, the general Nonogram problem is [https://en.wikipedia.org/wiki/NP-hard NP-hard]
    7 KB (908 words) - 18:50, 6 October 2020
  • ...osed the [[History Heuristic]] <ref>[[Jonathan Schaeffer]] ('''1983'''). ''The History Heuristic''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]</ref> ...onathan Schaeffer superseded [[David Levy]] as [[ICGA#Board|president]] of the [[ICGA]] <ref>[https://icga.org/?p=2672 A NEW PRESIDENT - Announcement by D
    47 KB (6,253 words) - 19:20, 4 April 2022
  • ...l Move Pruning]], but Feldmann's [[Fail-High Reductions]] as well based on the [[Null Move Observation]] <ref>[[Rainer Feldmann]] ('''1997'''). ''Fail-Hig [Site "The Hague NED"]
    10 KB (1,401 words) - 09:35, 6 July 2021
  • ...Protector]] and [[GridGinkgo]], playing the [[PT 49]] in October 2015, and the [[WCCC 2016]], incorporate [[Raimund Heid|Raimund Heid's]] [[Protector]], a ...ine spezielle Form der künstlichen Intelligenz] (German), translated with the help of [https://en.wikipedia.org/wiki/Google_Translate Google Translate]</
    7 KB (848 words) - 17:18, 16 November 2020
  • ...thesis in Computer Science, ''Selective Depth-First Game-Tree Search'' at the [[University of Alberta]] in 2002 <ref>[[Yngvi Björnsson]] ('''2002'''). ' ...erved as Vice-President of the [[ICGA]] from 2005 until 2011 and organized the [[WCCC 2005]] in Reykjavík.
    17 KB (2,384 words) - 21:42, 30 November 2021
  • [[FILE:Jingu Gaien Ginkgo Street Tokyo.jpg|border|right|thumb| Grid of Ginkgo trees in Tokyo <ref>[http://www.japan-talk.com/jt/new/icho-namiki ...kipedia.org/wiki/Stockholm Stockholm], GridGinkgo became runner-up, losing the play-off versus [[Komodo]].
    6 KB (849 words) - 12:23, 13 July 2019
  • ...on a 4x8 grid. Along with [[Tsan-sheng Hsu]], Bo-Nian Chen is co-author of the Chinese Dark Chess program [https://www.game-ai-forum.org/icga-tournaments/ ...ang Chen]], [[Bo-Nian Chen]], [[Tsan-sheng Hsu]] ('''2009'''). ''TMSK wins the Chinese-Chess tournament''. [[ICGA Journal#32_2|ICGA Journal, Vol. 32, No.
    4 KB (561 words) - 00:12, 9 March 2019
  • ...-tournaments/program.php?id=585 NCTU6-Lite], and holds his Ph.D. thesis on the topic of ''[[Proof-Number Search|Relevance-Zone-Oriented Proof Search for C ...Wu]], [[Ping-Hung Lin]], [[Shi-Jim Yen]] ('''2010'''). ''MoreThenFive wins the Connect-6 Tournament''. [[ICGA Journal#33_3|ICGA Journal, Vol. 33, No. 3]]
    4 KB (488 words) - 12:43, 7 June 2018
  • ...restricts Black to play at the two outer rows or columns of the board for the first move <ref>[[Shun-Shii Lin]], [[Chih-Hung Chen]], [[Shun-Chin Hsu]], [ ...ournaments''. [[ICGA Journal#37_1|ICGA Journal, Vol. 37, No. 1]]</ref> and the gold medal (shared) at [[TCGA 2014]].
    20 KB (2,569 words) - 12:33, 14 March 2022

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