...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
...ic games] and [[Reinforcement Learning|reinforcement learning]] along with the related [https://en.wikipedia.org/wiki/Markov_model Markov Models] for [htt
...ournament] <ref>[http://www.crosswordtournament.com/1999/art4.htm Proverb, the Crossword-Solving Computer Program]</ref> <ref>[https://en.wikipedia.org/wi
13 KB (1,801 words) - 17:32, 23 October 2018
...Diego, CA.</ref>, and in 2002, with his student [[John Romein]], he solved the game of [[Awari]] <ref>[[John Romein]], [[Henri Bal]] ('''2002'''). ''[http
...Optical_interconnect Optical Interconnect] <ref>[http://www.cs.vu.nl/das3/ The Distributed ASCI Supercomputer 3 (DAS-3)]</ref> .
8 KB (1,144 words) - 17:37, 16 November 2020
...], [[Tzung-Pei Hong]] ('''2009'''). ''[http://hal.inria.fr/inria-00369786/ The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournam
...php?id=515 Mogo], using [[Monte-Carlo Tree Search]] which uses patterns in the simulations and improvements in [[UCT]] <ref>[https://senseis.xmp.net/?MoGo
16 KB (1,987 words) - 12:32, 14 March 2022
...cal idealists who believe that applied properly, data can be used to solve the world's biggest problems <ref>[https://www.bayesimpact.org/ Bayes Impact |
...in [[UCT]] <ref>[http://www.lri.fr/~teytaud/mogo.html MoGo: a software for the Game of Go]</ref>.
8 KB (1,010 words) - 16:16, 5 September 2018
...he i860 never achieved commercial success and the project was abandoned in the mid-1990s.
...SIMD design influenced the later [[MMX]] extension of [[x86]] processors, the [https://en.wikipedia.org/wiki/P5_%28microarchitecture%29 Pentium MMX] in 1
4 KB (630 words) - 12:14, 30 June 2018
....htm Congress Center], the Invited and Contributed Lectures on Saturday at the [https://en.wikipedia.org/wiki/Dresden_University_of_Technology TU Dresden]
...sthetics and harmony. The popular science lecture shows some highlights of the application of mathematical ideas to problems of chess. Generally comprehen
20 KB (2,917 words) - 08:57, 2 July 2018
...g|tuning method]] called [[Minimax Tree Optimization]] (MMTO), also dubbed the '''Bonanza-Method'''. Kunihito Hoki further researched and published on [[M
...i Kaneko]] ('''2011'''). ''The Global Landscape of Objective Functions for the Optimization of Shogi Piece Values with a Game-Tree Search''. [[Advances in
6 KB (733 words) - 12:39, 23 August 2020
and in the field of education, the [https://en.wikipedia.org/wiki/Manga manga] case method <ref>[http://www.tu
...b63406ca Pure Nash equilibria of competitive diffusion process on toroidal grid graphs]''. [https://en.wikipedia.org/wiki/Discrete_Applied_Mathematics Disc
3 KB (394 words) - 21:33, 13 August 2018
...search/introduction/opal-ring/0000551.html Masakazu MURAMATSU Laboratory│The University of Electro-Communications]</ref> ]]
a Japanese mathematician, computer scientist, professor at the Graduate School of Informatics and Engineering, [https://en.wikipedia.org/w
4 KB (522 words) - 09:45, 30 September 2020
...ation of Achilles <ref>[[:Category:Eugène Delacroix|Eugène Delacroix]] - The Education of Achilles, circa 1862, [https://en.wikipedia.org/wiki/Getty_Cen
...i.ac.rs/ Achilles Home]</ref> . [[Đorđe Vidanović]] was responsible for the [[Opening Book|opening book]] <ref>[http://www.talkchess.com/forum/viewtopi
3 KB (395 words) - 16:23, 30 August 2018
...ned the term GPU for 3D graphics hardware acceleration. With the advent of the [https://en.wikipedia.org/wiki/Unified_shader_model unified shader architec
* Offload the search in [[Zeta|Zeta]]: run a parallel game tree search with move generati
63 KB (8,627 words) - 10:34, 24 January 2024
...ndgame Bitbases|endgame bitbases]] with few men, which was published under the [https://en.wikipedia.org/wiki/GNU_Free_Documentation_License GNU Free Docu
...ess.computer/lXIoGtvZ9b4/6zSqwV5iZCsJ Re: Extending endgame database using grid computing?] by [[Urban Koistinen]], [[Computer Chess Forums|rgcc]], Februar
5 KB (648 words) - 20:23, 18 July 2020
...], [[Tzung-Pei Hong]] ('''2009'''). ''[http://hal.inria.fr/inria-00369786/ The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournam
...rsity_of_Caen_Lower_Normandy Caen University] and engineering diploma from the [https://en.wikipedia.org/wiki/%C3%89cole_nationale_sup%C3%A9rieure_d%27ing
8 KB (964 words) - 17:45, 6 March 2019
...azz]], [[Sjaak (Glebbeek)|Sjaak]] and [[Leonidas]], all under the terms of the [[Free Software Foundation#GPL|GNU General Public Licence]].
..., Sjaak not to confused with [[Ronald de Man|Ronald de Man's]] engine with the same name <ref>[http://www.talkchess.com/forum3/viewtopic.php?f=7&t=37713&s
12 KB (1,576 words) - 21:58, 28 May 2021
...r scientist, and [[Go|Computer Go]] programmer, until 2009 affiliated with the [[University of Alberta]].
...<ref>[https://www.kayufu.com/gogui/ GoGui Documentation]</ref> using GTP, the [https://en.wikipedia.org/wiki/Go_Text_Protocol Go Text Protocol].
4 KB (581 words) - 17:55, 16 November 2020
...hp/dr-george-w-arnold-eng-sc-d/ Dr. George W. Arnold, Eng. Sc.D. – Smart Grid Center]</ref> ]]
...s national coordinator for [https://en.wikipedia.org/wiki/Smart_grid Smart Grid Interoperability],
5 KB (620 words) - 11:12, 13 June 2019
...ecoff Obituary - Boulder, CO], [https://en.wikipedia.org/wiki/Daily_Camera The Daily Camera], August 21, 2014</ref>.
...ipated at the [https://en.wikipedia.org/wiki/Halloween Halloween] event of the [[WMCCC 1986]] in [https://en.wikipedia.org/wiki/Dallas Dallas] running on
9 KB (1,255 words) - 21:04, 25 June 2019
...ppear in the drawing. [https://en.wikipedia.org/wiki/Grid_(graphic_design) Grid (graphic design) from Wikipedia], [https://en.wikipedia.org/wiki/Wikimedia_
...ad_balancing_%28computing%29 balance the load] dynamically. Each worker at the intra-cluster level is represented by [[Cluster Toga]], a YBWC version of [
9 KB (1,338 words) - 11:39, 13 July 2019
...flickr.com/photos/wonderlane/3172647615/in/photostream/ Kinkara, Citipati, The Dancing Enlightened Skeletons, Lord…] by Wonderlane, [https://en.wikipedi
...rforms no tree search itself but has some kind of a master role to control the optimistic [[Pondering|pondering]] with distributed worker clients.
4 KB (538 words) - 12:34, 13 July 2019
His 2005 Master's thesis was about [[Parallel Search]], the design and implementation of a parallel two-player state space searcher cal
* [[Jan Renze Steenhuisen]] ('''2003'''). ''Report on the 10th Advances in Computer Games Conference''. [[ICGA Journal#26_4|ICGA Jou
6 KB (725 words) - 14:39, 17 July 2019
...tps://dl.acm.org/citation.cfm?id=3293475 CIIS 2018]</ref>, and before with the [https://en.wikipedia.org/wiki/Chang_Jung_Christian_University Chang Jung U
...k]]. Along with Shun-Shii Lin and [[Yen-Chi Chen]], he further co-authored the [[Outer-Open Gomoku]] program and multiple Gold medal winner ''OOGiveMeFive
4 KB (486 words) - 15:26, 29 June 2020
...areas of [[Artificial Intelligence|artificial intelligence]], president of the [[AAAI]] from 1997 to 1999,
...on] from [[Massachusetts Institute of Technology]] - his thesis originated the field of [https://en.wikipedia.org/wiki/Local_consistency constraint propag
7 KB (904 words) - 23:57, 24 October 2019
As a chess composer, he founded the German Chess problem magazine ''Harmonie'' in 1987 and is again its publish
...s databases for chess problems, and.has further contributed to [[Popeye]], the [[:Category:Open Source|open source]] [[:Category:Problem|program for solvi
6 KB (767 words) - 17:50, 31 January 2020
a Canadian computer scientist and professor emeritus at the [[University of Alberta]].
Robert Holte was member of the ''University of Alberta Computer Poker Research Group'' (CPRG) <ref>[http:/
12 KB (1,563 words) - 13:15, 2 May 2020
...on program [https://en.wikipedia.org/wiki/Bonanza Bonanza] on the porch of the [https://en.wikipedia.org/wiki/Ponderosa_Ranch Ponderosa] from 1962.
...formation was often distributed through ad or public relations agencies by the network, studio, or program's sponsor.
11 KB (1,624 words) - 09:15, 25 August 2020
....wikipedia.org/wiki/Supercomputer supercomputers] produced by [[Intel]] in the 90s.
...roprocessor microprocessor]. Up to 4096 i860s nodes were connected in a 2D grid <ref>[https://en.wikipedia.org/wiki/Intel_Paragon Intel Paragon from Wikipe
2 KB (329 words) - 13:46, 15 September 2020
[https://en.wikipedia.org/wiki/The_Netherlands The Netherlands],
He was member of the research team behind the ''Little Green Machine'' a [[GPU]] [https://en.wikipedia.org/wiki/Beowulf_c
7 KB (989 words) - 22:19, 5 October 2020
ConvChess was likely the first chess playing entity using a CNN, as mentioned by [[Matthia Sabatelli
ConvChess is implemented in [[Python]], using the [[python-chess]] and [https://en.wikipedia.org/wiki/NumPy NumPy] libraries,
7 KB (1,059 words) - 10:27, 1 June 2021
