Search results

...bit word]] or register covers the whole board. Even more bitboard friendly is [[Checkers]] with 32-bit bitboards and less [[Pieces#PieceTypeCoding|piece- Of course bitboards are not only about the existence of pieces - it is a general purpose, '''set-wise''' data-structure fitting in one 64-bit regi

Computer chess is actively discussed in several Discord channels: * [https://groups.google.com/forum/#!forum/shogi-l SHOGI-L]

Several lists of computer chess programs or '''Chess engines''', which is the chess playing part of the chess program, relying on proprietary or [[Pr * [[:Category:Shogi]]

A '''Protocol''' is a [https://en.wikipedia.org/wiki/Formal_methods formal description] of [htt The aim of computer chess protocols is to define a standard to let a chess engine communicate with [[User Interfac

...he latter situation might indicate that some kind of merging or re-editing is necessary. * [[CSA]] - Computer Shogi Association

...[Marco Costalba]], [[CCC]], October 02, 2011</ref>. From that, the project is being developed and maintained by the [[:Category:Stockfish Contributor|Sto A synergy effect with the [[Shogi]] community led to the promising branch of [[Stockfish NNUE]], courtesy of

* [[World Computer Shogi Championship]] * [http://www.talkchess.com/forum/viewtopic.php?t=65061 What is a Match?] by [[Henk van den Belt]], [[CCC]], September 01, 2017

...fish#TestingFramework|Testing Framework]] called ''Fishtest''. Leela Chess is [[:Category:Open Source|open source]], released under the terms of [[Free S The goal is to build a strong chess playing entity following the same type of [[Deep Le

Don Beal is author and co-author of following chess programs <ref>[https://www.game-ai- ...with the Null Move.'' [[Advances in Computer Chess 5]], a revised version is published ('''1990''') under the title ''A Generalized Quiescence Search Al

...ary Games''. [[Advances in Computer Games 9]], pp. 157-174. [http://www.ru.is/faculty/yngvi/pdf/BjornssonM01b.pdf pdf]</ref>, with the aim to improve the ...h"></span>A difficulty in tuning and automated tuning of engine parameters is measuring [[Playing Strength|playing strength]]. Using small sets of [[Tes

...e which is presumed to be the common ancestor of the games of [[Chess]], [[Shogi]] and [[Chinese Chess]] <ref>[https://en.wikipedia.org/wiki/Origins_of_ches

...nd the value of White's position after each is calculated; the move played is that which maximizes this value. In calculating the value of a position, th ...squares to which that piece might legally move (whether or not that square is occupied by a piece) added up. Thus an opening move of e4 increases the val

...[[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://ar MCTS is based on randomized explorations of the [[Search Space|search space]]. Usin

...zing player is assured of and the maximum score that the minimizing player is assured of respectively. Consider the following example... ...lower bound]]. We know that we can achieve at least that, so anything that is clearly worse can be ignored.

...nstance as history score chart indexed by ply. Related to Machine learning is [https://en.wikipedia.org/wiki/Evolutionary_computation evolutionary comput ...rol in Adversary Games''. [[Advances in Computer Games 9]], [http://www.ru.is/faculty/yngvi/pdf/BjornssonM01b.pdf pdf]</ref> or [[Time Management|time us

...But what if you were to search one move deeper and find that the next move is PxQ? You didn't win a pawn, you actually lost a queen. Hence the need to ma ...rches are typically very short, about 50%-90% nodes are spent there, so it is worthwhile to apply some [[Pruning|pruning]] there. Apart from not trying m

...[[Upper Bound|upper bound]]. The none [[Recursion|recursive]] [[ProbCut]] is applied at both types of none [[Node Types#PV|PV-nodes]]. Rather than immed ...ory Pruning <ref>[https://www.stmintz.com/ccc/index.php?id=434817 Re: What is History Pruning?] by [[Tord Romstad]], [[CCC]], July 03, 2005</ref>

...th]] of the subtree under the null move. The value of this depth reduction is known as [[Depth Reduction R|R]]. ...It determines the answer by assuming Black does nothing on his turn, that is, by playing a "No Move" and then seeing if White can enforce an immediate c

...not show an escape. ProbCut is a generalization of this method in that it is game independent. It was tested by incorporating it in Buro's already stron ...of a deeper search with depth ''d > d'''. A way to model this relationship is by means of a [https://en.wikipedia.org/wiki/Linear_model linear model]:

...current position. If this does not exceed alpha then the futility pruning is triggered to skip this move (which further means setting a flag like ''f_pr Futility pruning is not used when the [[Side to move|side to move]] is in [[Check|check]] , or when either [[Alpha|alpha]] or [[Beta|beta]] are cl

...93e071c2b739f164ae5ffa6c Efficiency of three Forward-Pruning Techniques in Shogi: Futility Pruning, Null-move Pruning, and Late Move Reduction (LMR)]''. [ht * [https://www.stmintz.com/ccc/index.php?id=434809 What is History Pruning?] by [[David Dahlem]], [[CCC]], July 03, 2005

...termine if a move is worth searching and do not need the actual value. SEE is useful in [[Move Ordering|move ordering]], [[Futility Pruning|futility prun ...2009</ref> . In most programs, however, an [[Iteration|iterative]] version is used, as demonstrated in [[SEE - The Swap Algorithm]] with [[Bitboards|bitb

...ption, "With the Vigilance Committee in the East End". This specific image is entitled "A Suspicious Character", [https://en.wikipedia.org/wiki/Jack_the_ ...[Fail-High|fails high]], a [[Quiet Moves|quiet move]] that caused a cutoff is stored in a table indexed by [[Ply|ply]], typically containing two or three

...move in the game tree. This move will not obtain a high history score and is therefore ranked quite low in the move ordering. The idea is to make the history scores (<span style="background-color: #d2d2d2">hhScore

...04 Jaap van den Herik's ICGA Tournaments]</ref> . Since the early 90s Jaap is Tournament director, organizer and arbiter of [[ICCA]] and [[ICGA]] compute ...computer%20van%20de%20toekomst.pdf pdf] hosted by [[Hein Veldhuis]]</ref>, is it [[Gambiet]]?

...xity] of 10<span style="font-size: 80%; vertical-align: super;">123</span> is based on an [[Branching Factor|average branching factor]] of 35 and an aver This page is about the basic chess items, [[Chessboard|chessboard]], [[Pieces|pieces]] a

'''Castling''' is a composite [[Moves|move]] of [[King]] and [[Rook]] at the same time. In st While castling is [[Irreversible Moves|irreversible]] with respect to the [[Castling Rights|c

'''Generation''' of [[Moves|moves]] is a basic part of a chess engine with many variations concerning a [https://e ...left up to the [[Make Move|move-making function]] to test the move, or it is even possible to let the king remain in check and only test for the capture

...fects a small fraction of the complete board structure and the update cost is small compared to a copy of the whole board. Also one usually doesn't need It is a good idea to compare incremental updated stuff like zobrist keys with its

...ocessors is an interesting domain of research, as traversing a search tree is inherently serial. Several approaches have been devised, with the most popu ...le entries. Many programs used this if a "quick and dirty" approach to SMP is needed. It had the reputation of little speedup on a mere 2 processors, and

.../en.wikipedia.org/wiki/Semantics semantic] unit, a meaningful pattern that is recognized at a glance by a chess master. Reasoning about a position in ter * [[Herbert Simon]] ('''1974'''). ''How big is a chunk''? [https://en.wikipedia.org/wiki/Science_%28journal%29 Science], V

...ский район - «Plan is law, fulfillment is duty, over-fulfillment is honor!» Building Olkhovskaya Batkovsky - peat enterprise [http://www.stad. Long-range planning by human chess players is usually made on the basis of [https://en.wikipedia.org/wiki/Reason reasonin

is used to assign a label to an input value <ref>[https://en.wikipedia.org/wik ...96'''). ''Using Pattern Recognition and Selective Deepening to Solve Tsume Shogi''. [[Conferences#GPW|3rd Game Programming Workshop]], [http://citeseerx.ist

...org/wiki/Appleton-Century-Crofts Appleton-Century-Crofts], New York</ref>, is the study of how people or [https://en.wikipedia.org/wiki/Intelligent_agent * [[Herbert Simon]] ('''1974'''). ''How big is a chunk''? [https://en.wikipedia.org/wiki/Science_%28journal%29 Science], V

...e [https://en.wikipedia.org/wiki/Proof_game proof game] whether a position is legal in the sense that it could be reached by a series of [[Legal Move|leg ...White the winning side. Files of sets of chess positions, where a one-bit is associated with the Gödel number of a position, are successively manipulat

...e|makemove]]/[[Unmake Move|undomove]], which gives much faster results and is a better indicator of the raw move generator speed (versus move generator + ...]] node counts, with a small chance for inaccurate results. Sometimes this is used as a sanity check to make sure the hash table and keys are working cor

A '''Move List''' is a data structure inside a chess program with the aim to collect, administra ...and played after search, or a move was entered by the opponent player, it is stored under the [http://en.wiktionary.org/wiki/post-increment post increme

...al, Vol. 35, No. 3]]</ref> <ref>[[Jaap van den Herik]] ('''2012'''). ''All is Proof Numbers''. [[ICGA Journal#35_3|ICGA Journal, Vol. 35, No. 3]] (editor ...if at least one child is ''false'', else ''unknown'' if at least one child is ''unknown'', otherwise ''true''. At OR-nodes, ''false'' and ''true'' are in

...ance of [[Material|material]], the aggregated point values for both sides, is usually the most influential term. ...and '''40'''. These values are good, but this modification of the argument is artificial.

The '''ICGA Journal''', formerly, until 1999, the ICCA Journal is the quarterly published magazine, received by all [[ICGA]] members <ref>[ht * [[Monroe Newborn|Monty Newborn]], ''The laughing is over''.

.../en.wikipedia.org/wiki/Probability probability] W and the pawn advantage P is ...s taken. This was considered reasonable because the material configuration is the most important quantity that affects the result of a game.

...e of each [[Color|color]], and values assigned to each square. This scheme is fast, since the evaluation term from the piece square tables can be [[Incre ...nstead of one fixed value for, say, an [[Isolated Pawn|isolated pawn]]. It is also possible to use piece-square tables for [[Move Ordering|move ordering]

...Trail]] of the [https://en.wikipedia.org/wiki/Ruhr Ruhr area], "The dragon is a symbol of physical strength and intelligence with respect to the snake th ...ves Observation'' ('''WMO'''), which states the practical playing strength is not primarily determined by the quality of the players best moves nor avera

'''XBoard''' is a graphical user interface for the [[Chess Engine Communication Protocol]] ...Pettus]], [[Computer Chess Forums|Winboard Forum]], October 19, 2013 » [[Shogi]]

...on protocol] for chess engines to play [[Games|games]] automatically, that is to communicate with other programs including [[GUI|Graphical User Interface ...but also keeps the Model with its internal [[Chess Game|game states]]. It is also an "arbiter" instance to decide about the outcome of the game, for ins

...notion of cumulative [https://en.wikipedia.org/wiki/Reward_system reward] is maximized. In computer games, reinforcement learning deals with adjusting f ...to get more information about the expected payoffs of the other machines - is also faced in reinforcement learning.

...ia]</ref>. In the domain of computer games and computer chess, TD learning is applied through self play, subsequently predicting the [https://en.wikipedi ...ost simply a single neuron [[Neural Networks#Perceptron|perceptron]], that is a linear [[Evaluation|evaluation]] function ...

...s, whose dot-product activates or controls the post-synaptic output, which is the base of Neural network learning <ref>[https://en.wikipedia.org/wiki/Bio ...[https://en.wikipedia.org/wiki/Loss_function cost or loss function], which is a task in [https://en.wikipedia.org/wiki/Mathematical_optimization mathemat

...i/Netherlands Netherlands], on June 27 and 28, [[Timeline#1996|1996]]. ACC is the conference of the [[ICCA]]. Invited speaker [[Ken Thompson]] talked abo ...'). ''Diminishing Returns for Additional Search in Chess.'' [http://www.ru.is/faculty/yngvi/pdf/JunghannsSBBM97.pdf pdf]

...[Heinz Nixdorf MuseumsForum]] (HNF), Fürstenallee 7, 33102 Paderborn. ACC is the conference of the [[ICCA]]. 14-15 accepted papers and 5 invited papers ...'Variable-Depth Search.'' [[Advances in Computer Games 9]], [http://www.ru.is/faculty/yngvi/pdf/MarslandB01.pdf pdf]

...nternational Computer Games Association]]. The objective of the conference is to provide an international forum for researchers in the field of Artificia ...berta.ca/~nathanst/papers/partialEndgameDatabases.pdf pdf], [http://www.ru.is/faculty/yngvi/pdf/BjornssonSS06.pdf pdf]

...6-5_16 The Global Landscape of Objective Functions for the Optimization of Shogi Piece Values with a Game-Tree Search]''. ...nk.springer.com/chapter/10.1007/978-3-642-31866-5_18 Infinite Connect-Four Is Solved: Draw]''.

...k.springer.com/chapter/10.1007/978-3-319-09165-5_18 Comparison Training of Shogi Evaluation Functions with Self-Generated Training Positions and Moves]''. [ ...'2013'''). ''Cylinder-Infinite-Connect-Four except for Widths 2, 6, and 11 is Solved: Drawn''. [[CG 2013]]

! IS ==[[Shogi]]<span id="Shogi"></span>==

...Chess Championship]]. The WMCCC and Olympiad were held in Ad Fundum which is located on the base floor of the former [https://en.wikipedia.org/wiki/Maas ! IS

! IS ==[[Shogi]]<span id="Shogi"></span>==

==[[Shogi]]<span id="Shogi"></span>== ...-ai-forum.org/icga-tournaments/tournament.php?id=91 8th Computer Olympiad, Shogi - Graz 2003 (ICGA Tournaments)]</ref>

! IS ==[[Shogi]]<span id="Shogi"></span>==

* [[Shogi]] (Japanese Chess) ...oceedings of the Institute of Radio Engineers Vol. 41, No. 10 <ref>[[Hex]] is a special case of the [https://en.wikipedia.org/wiki/Shannon_switching_game

...'). ''Computer-Aided Game Play and Computer Cheating: Examples from Chess, Shogi, and Go''. [https://www.uni-trier.de/fileadmin/fb4/prof/BWL/FIN/Veranstaltu ...cle/abs/pii/000437029190042I#! A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Algorithm]''. [https://en.wikipedia.org/wiki/Artifi

...es.chinese-chess]], November 18, 1994</ref>,<br/> is a chess variant which is very popular in East Asia, especially in China and Vietnam. The Chinese Che Cannon is the most interesting piece in Chinese chess.

a [[Chess#Variants|chess variant]] which incorporates the [[Shogi]] rule in which a player can [[Piece Drop|drop]] a [[Captures|captured piec ...wesome lichess :-)] by [[Marco Costalba]], [[CCC]], August 14, 2016</ref>, is able to play Crazyhouse as well. In 8 months, Stockfish-Crazyhouse was impr

'''[[Main Page|Home]] * [[Games]] * Shogi''' ...gi.com/ MacShogi], [https://en.wikipedia.org/wiki/Shogi#Setup_and_gameplay Shogi - Setup and gameplay - Wikipedia]</ref> ]]

...rg/icga-tournaments/game.php?id=12 Go] at the [[Computer Olympiad]]</ref>, is played on boards with 9x9 as well with default 19x19 [https://en.wikipedia. ...er [https://en.wikipedia.org/wiki/Ke_Jie Ke Ji]. After the Summit, AlphaGo is now retired from competitive play while DeepMind continues AI research in o

...13x13 or 19x19 [https://en.wikipedia.org/wiki/Rhombus Rhombus]. The goal is to connect the opposing sides of own colors with own stones - or to prevent ...Game-state Reduction''. [[Advances in Computer Games 10]], [http://www.ru.is/faculty/yngvi/pdf/HaywardBJKPR03.pdf pdf]</ref> .

...with two times six pieces or checkers per side, White and Black. The goal is to connect all of one's pieces into a single group. Checkers alternately (s ...shima]] ('''2002'''). ''Realization-Probability Search: Its application to Shogi and LOA''. [[7th Computer Olympiad#Workshop|7th Computer Olympiad Workshop]

...a set of light and a dark turnable pieces for each side. The player's goal is to have a majority of their colored pieces showing at the end of the game, ...hello/howto.html Writing an Othello program] by [[Gunnar Andersson]]</ref> is an appealing and interesting challenge. Beside the dedicated Othello progra

...orce maximal capturing rules as used in some versions of [[Checkers]], and is packed with 350 board games, puzzles, and variants <ref>[http://www.zillion * [[Shogi]]

...Guid]], [[Aritz Pérez]], [[Ivan Bratko]] ('''2008'''). ''How trustworthy is Crafty's analysis of world chess champions''? [[ICGA Journal#31_3|ICGA Jour ...to_Computer_Shogi Context Killer Heuristic and Its Application to Computer Shogi]''. [[CGW 2007]]

...n.wikipedia.org/wiki/Chess_aesthetics Chess aesthetics] or beauty in chess is generally appreciated by both players and composers, awarded in certain cha * [[Norman A. Macleod]] ('''1983'''). ''Is the Computer Going to Take Over from the Composer?'' [[ICGA Journal#6_2|ICC

...//en.wikipedia.org/wiki/Statistical_population statistical population], it is conventional to hypothesize a [https://en.wikipedia.org/wiki/Statistical_mo The score is a representation of the tournament-outcome from the viewpoint of a certain

...ry, [[Opponent Model Search]], and [[Shogi|Computer Shogi]]. Hiroyuki Iida is Professor at [[JAIST|Japan Advanced Institute of Science and Technology (JA =Shogi=

[[FILE:kishi.jpg|border|right|thumb|240px| Akihiro Kishimoto <ref>[http://www.is.titech.ac.jp/~kishi/ Welcome to Akihiro Kishimoto's Page]</ref> ]] ...h]], Akihiro Kishimoto is author of the [[Shogi]] program [[ISshogi]], and is further author of the [[Go]] playing program [https://www.game-ai-forum.org

...ps://en.wikipedia.org/wiki/University_of_Twente University of Twente]. Jos is author of the chess program [[Touch]], co-author of the [[Connect Four]] pr ...lis]] ('''1989'''). ''A Knowledge-Based Approach to Connect Four: The Game is Over, White to Move Wins''. [[1st Computer Olympiad#Workshop|Heuristic Prog

...o]] implementation dubbed [[CrazyZero]] has networks trained to play Go, [[Shogi]], [[Gomoku]], [[Othello]], [[Renju]], and Chess <ref>[http://www.talkchess Rémi is further co-author of [https://www.game-ai-forum.org/icga-tournaments/progra

...of neural networks. A [[Neural Networks#Deep|deep neural network]] (DNN) is an ANN with multiple hidden layers of units between the input and output la ...ning|automated tuning]] - in a two layers neural network, the second layer is responsible for a [[Tapered Eval|tapered eval]] to phase [[Endgame|endgame]

[[HIARCS]] - [[Komodo]], [[Hans van der Zijden]] is about to resign, Hiarcs operated by [[Harvey Williamson]] wins PT 51 ...rt Muller]], who has some cores <br/>left to demonstate his newest 16x16 [[Shogi]] variant - in the background tournament director [[Jan Krabbenbos]]

* [[Shogi]] ...tory.co.uk/newsletter/2014_02_completely_random.htm When Completely Random is Just not Random Enough]''. [[AI Factory]], February 2015

...well as its current state in that environment - the corresponding process is called a [https://en.wikipedia.org/wiki/Bayes%27_theorem Bayes-Adaptive] MD ...[[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://ar

...[AlphaZero]] projects mastering the games of [[Go]], [[Chess|chess]] and [[Shogi]], and holds a B.Sc. in software enginering from [[Vienna University of Tec ...[[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://ar

...arning|machine learning]], and [[Games|games]]. His current research focus is on [https://en.wikipedia.org/wiki/Sampling_%28statistics%29 sampling] algor ...[[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://ar

...of [https://en.wikipedia.org/wiki/Eleanor_Maguire Eleanor Maguire], and he is still affiliated with UCL as honorary research associate at their [https:// ...978 Kumaran, Dharshan FIDE Chess Profile]</ref>. With a rating of 2505, he is no longer active in official [[FIDE]] tournaments since 1998 <ref>[https://

...[AlphaZero]] projects mastering the games of [[Go]], [[Chess|chess]] and [[Shogi]]. Thore Graepel received his Ph.D. in machine learning from [https://en.wi ...[[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://ar

...[AlphaZero]] projects mastering the games of [[Go]], [[Chess|chess]] and [[Shogi]]. He holds a B.Sc. in [[Cognition |cognitive science]] and [[Artificial In ...[[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://ar

...4, with an Elo rating of 2300 at the age of 13, is an accomplished [[Shogi|shogi]] and [[Poker|poker]] player <ref>[http://demishassabis.com/biography/ DH - ...[[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://ar

...[[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://ar ...[[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://ar

...rnament''. [[ICGA Journal#38_4|ICGA Journal, Vol. 38, No. 4]]</ref>, the [[Shogi]] program [[EVG]], and the [https://en.wikipedia.org/wiki/Nurikabe Nurikabe [[Category:Shogi Programmer|Chen]]

...gust 2013, features a CAPI port (Coherent Accelerator Processor Interface) is layered on top of [https://en.wikipedia.org/wiki/PCI_Express#PCI_Express_3. | rowspan="2" | The structure is a two-dimensional array of logic blocks and reconfigurable routing channels

...ipedia.org/wiki/Tic-tac-toe noughts and crosses], [[Chinese Chess]], and [[Shogi]] <ref>[http://www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/games/d ...Hitoshi Matsubara]], [[Barney Pell]] ('''1994'''). ''Applying metagamer to Shogi''. [[Conferences#GPW|1st Game Programming Workshop in Kanagawa, Japan]]

...hogi-l/bazz1reADOY/KB8UvBZQf_cJ WCSC20 Participant List] by Nobu, SHOGI-L, Shogi Google Group, February 02, 2010</ref>, and a [https://en.wikipedia.org/wiki Takeshi Ito at Forum of Computer Games 2010 - The Challenge of Computer Shogi <ref>[http://www.iis.sinica.edu.tw/cgforum2010/eng_index.html Forum of Comp

...nsistent codebase for multiple games such as [[Draughts]], [[Chess960]], [[Shogi]], and [[Othello]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=656 ...|SWAR-popcount]]. In Senpai '''2.0''' the [[Copy-Make|copy/make]] approach is used, customary in games with fewer [[Pieces|piece types]] than chess.

...onsumer grade [[Engines|chess engines]] and [[GUI|GUIs]] is not great, but is improving. Once, [[XBoard]] with [[GNU Chess]] was the only program, but no ...ication Binary Interface] standards (ABI's). The information provided here is based on my own research and therefore descriptive rather than normative. I

...ller]], October 16, 2016</ref>. His open source engine [[CrazyWa]] plays [[Shogi]] and [[Games#ChessVariants|Chess variants]] with [[Piece Drop|piece drops] ..., 2013</ref>, gold in Shogi and Mini-Shogi at the [[18th Computer Olympiad#Shogi|18th Computer Olympiad 2015]], and also won the 2015 UEC Cup <ref>[http://w

...], [[JavaScript]], and [https://en.wikipedia.org/wiki/Node.js Node.js]. He is author of multiple game playing and puzzle programs for various target plat Gary Linscott is author of the [[:Category:Open Source|open source chess engines]] and appli

...''' <ref>[http://psp.gamespy.com/playstation-portable/ai-series-shougo/ AI Shogi - PlayStation Portable - GameSpy]</ref>, the [[Go]] program [https://www.ga ...CGA Journal#26_4|ICGA Journal, Vol. 26, No. 4]] » [[8th Computer Olympiad#Shogi|8th Computer Olympiad]]

...hogi]] program [https://en.wikipedia.org/wiki/Shotest_Shogi Shotest]. Jeff is CEO and Founder of the [[AI Factory]] <ref>[http://www.aifactory.co.uk/AIF_ ...mputer Olympiad 2001]] <ref>[[Jeff Rollason]] ('''2001'''). ''Shotest wins Shogi tournament''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]], pp. 187</

...winning ahead of [[HIARCS]] and [[MChess]], and the [[WCCC 1995]]. WChess is the chess engine of [[Sierra|Sierra's]] [[Power Chess]] <ref>[http://www.re ...end [[Endgame Tablebases|game databases]] for [[KPK]] although the author is looking into adding more databases.

...medal winner of the [[15th Computer Olympiad#Shogi|15th Computer Olympiad, Shogi]] in [https://en.wikipedia.org/wiki/Kanazawa,_Ishikawa Kanazawa]. .../200218/000020021802A0583583.php Implementation of "Gekisashi". A Computer Shogi Player]''. [http://sciencelinks.jp/j-east/journal/J/L0461A/2006.php Joho Sh

...medal winner of the [[15th Computer Olympiad#Shogi|15th Computer Olympiad, Shogi]] in [https://en.wikipedia.org/wiki/Kanazawa,_Ishikawa Kanazawa]. .../200218/000020021802A0583583.php Implementation of "Gekisashi". A Computer Shogi Player]''. [http://sciencelinks.jp/j-east/journal/J/L0461A/2006.php Joho Sh

...e Gold medal at the [[15th Computer Olympiad#Shogi|15th Computer Olympiad, Shogi]] 2010 in [https://en.wikipedia.org/wiki/Kanazawa,_Ishikawa Kanazawa]. ...ashi Chikayama]] ('''2002'''). ''Implementation of "Gekisashi". A Computer Shogi Player''. [http://sciencelinks.jp/j-east/journal/J/L0461A/2006.php Joho Sho

...jp/rccg/menu/topic.htm Research Center for Computers and Games - Tacos Won Shogi Tournament at the 10th Computer Olympiad], September 18, 2005</ref> ]] ...iads]] <ref>[https://www.game-ai-forum.org/icga-tournaments/game.php?id=17 Shogi] at the [[Computer Olympiad]]</ref>.

...as also been connected with the development of [[AI Factory|AI Factory's]] Shogi engine [[Shotest]] by primary author and AI Factory CEO [[Jeff Rollason]] < ...factory.co.uk/newsletter/2006_01_shogichampionship_2006.htm World Computer Shogi Championship 2006 - AI Factory newsletter article Spring 2006]</ref>

...https://en.wikipedia.org/wiki/Computer_shogi#Denou-sen_.282013.29 Computer shogi - Computers versus humans - Denou-sen (2013) - Wikipedia]</ref>. ...ttp://link.springer.com/chapter/10.1007/11922155_10 Dual Lambda Search and Shogi Endgames]''. [[Advances in Computer Games 11]]

...go.jp/article/jssst/29/1/29_1_1_75/_article GPSShogi and Assembly of Large Shogi Software with Text Protocol]''. [https://www.jstage.jst.go.jp/browse/jssst/ ...https://en.wikipedia.org/wiki/Computer_shogi#Denou-sen_.282013.29 Computer shogi - Computers versus humans - Denou-sen (2013) - Wikipedia]</ref>.

...https://en.wikipedia.org/wiki/Computer_shogi#Denou-sen_.282013.29 Computer shogi - Computers versus humans - Denou-sen (2013) - Wikipedia]</ref>. ...ttp://link.springer.com/chapter/10.1007/11922155_10 Dual Lambda Search and Shogi Endgames]''. [[Advances in Computer Games 11]]

...ch]] and [[Learning|learning]] algorithms in the computer board games of [[Shogi]], [[Chess]], [[Go]], and [[Othello]] <ref>[https://sites.google.com/site/t ...s of Computer Players by the Evaluation Scores and Principal Variations in Shogi]''. [http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7335993 AC

...is actually played. By definition, the realization probability of the root is one. After making a move during the course of the game, all workers formerl ...ted environment, they used at most 64 cores in two computers each of which is equipped with two [[Intel]] [[x86-64|Xeon E5-4650]] processors. Stockfish r

...nt of many game playing programs in the domains of [[Go]], [[Block Go]], [[Shogi]], [[Dots and Boxes]], [[Trax]], [https://en.wikipedia.org/wiki/Puyo_Puyo_( ...ut [[Search|search]], and became runner-up at the [[20th Computer Olympiad#Shogi|20th Computer Olympiad, Leiden 2017]] behind [[Harm Geert Muller|HGM's]] [[

...wiki/Mahjong Mah Jong], killer-tree heuristic and lambda-search method. He is member of [[Hiroyuki Iida|Hiroyuki Iida's]] ''games laboratory'', where he ...al winner at [[Computer Olympiad|Computer Olympiads]], where Jun Nagashima is also member of the team headed by [[Tsuyoshi Hashimoto]].

...g/shogi-l/Nylx9GIXEgw/qh06-VPUNSsJ Announcement of the 21st World Computer Shogi Championship]</ref>, the four times Gold medal winner at [[Computer Olympia ...c.jp/naid/110006381103 An Efficient Use of Piece-Square Tables in Computer Shogi]''.

...acos]] <ref>[[Jun Nagashima]] ('''2007'''). ''Towards master-level play of Shogi''. Ph.D. thesis, Supervisor [[Hiroyuki Iida]], [[JAIST]], [https://dspace.j ...mputer Olympiad 2001]] <ref>[[Jeff Rollason]] ('''2001'''). ''Shotest wins Shogi tournament''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]], pp. 187</

...e Assistant Professor. As [[Shogi]] programmer, he is author of the strong Shogi program [[Bonanza]], famous for its [[Supervised Learning|supervised]] [[Au ...chapter/10.1007%2F978-3-642-17928-0_15 Consultation Algorithm for Computer Shogi: Move Decisions by Majority]''. [[CG 2010]]

...hogi-l/bazz1reADOY/KB8UvBZQf_cJ WCSC20 Participant List] by Nobu, SHOGI-L, Shogi Google Group, February 02, 2010</ref>. ...chapter/10.1007%2F978-3-642-17928-0_15 Consultation Algorithm for Computer Shogi: Move Decisions by Majority]''. [[CG 2010]]

...ef>Image clipped from [[Takeshi Ito]] ('''2011'''). ''Clair 1/128 wins 5x5 Shogi Tournament''. [[ICGA Journal#34_1|ICGA Journal, Vol. 34, No. 1]], pp. 41</r ...''). ''The Global Landscape of Objective Functions for the Optimization of Shogi Piece Values with a Game-Tree Search''. [[Advances in Computer Games 13]]</

...tps://en.wikipedia.org/wiki/Ghent_University Universiteit Gent]</ref>, and is post-doctoral fellow of the Research Foundation Flanders (FWO) and member o * [http://www.shogi.net/fesa/esc2003/participants/ European/Worldwide Open Shogi Championship 2002 - Participants]

...2/6419/1140 A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play]''. [https://en.wikipedia.org/wiki/Science_(journ ...ay in the games of chess and [[Shogi]] as well as in [[Go]]. The algorithm is a more generic version of the [[AlphaGo#Zero|AlphaGo Zero]] algorithm that

...hapter/10.1007/3-540-45579-5_19 SUPER-SOMA - Solving Tactical Exchanges in Shogi without Tree Searching]''. [[CG 2000]], [http://www.aifactory.co.uk/downloa ...fault.htm Chess - MSN Games - Free Online Games]</ref>. Further, Treebeard is incorporated in AI Factory's [[Chess Free]] for [[Android]] <ref>[http://ww

...a Forum]] November 11, 2008</ref> , chess writer, [[:Category:Shogi Player|Shogi player]], chess teacher, [[:Category:Opening Book Author|opening book autho ...rry Kaufman collaborated with [[Don Dailey]] and [[Julio Kaplan]]. Kaufman is well known for his research on [[Material|material]] <ref>[https://en.chess

...pub/jon-dart/3/382/b7 Jon Dart | LinkedIn]</ref>. As a chess programmer he is author of the [[Chess Engine Communication Protocol]] and [[UCI]] compatib ...ing] by [[Jon Dart]], [[CCC]], January 25, 2015 » [[Automated Tuning]], [[Shogi]] <ref>[[Kunihito Hoki]], [[Tomoyuki Kaneko]] ('''2014'''). ''[https://www.

...ecified by the [https://en.wikipedia.org/wiki/Khronos_Group Khronos Group] is widely adopted across all kind of hardware accelerators from different vend ...ransition from OpenCL to [https://en.wikipedia.org/wiki/Metal_(API) Metal] is recommended by [[Apple]].

...[[Computer Chess Forums|Winboard Forum]], September 05, 2009</ref>. UCI2WB is open source, licensed under the [[Free Software Foundation#GPL|GPL Version * [http://www.open-aurec.com/wbforum/viewtopic.php?f=18&t=46851 Is it time for a new and improved UCI2WB adapter?] by [[Günther Simon]], [[Co

Alexander Lyashuk is primary developer of [[Leela Chess Zero]], in particular the rewritten [[Le * [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=72340 What is the purpose of chess engines?] by [[Alexander Lyashuk|crem]], [[CCC]], Nove

...rovisions]. Faithful reproductions may be reused under that licence, which is considered expired 50 years after their creation, [https://en.wikipedia.org ...hapter/10.1007/3-540-45579-5_19 SUPER-SOMA - Solving Tactical Exchanges in Shogi without Tree Searching]''. [[CG 2000]]</ref>. Rasputin entered internationa

...uuchan]], Bronze medal winner in Minishogi at the [[17th Computer Olympiad#Shogi|17th Computer Olympiad]] in [https://en.wikipedia.org/wiki/Yokohama Yokoham Yoshiyuki Kotani is further [https://en.wikipedia.org/wiki/Maze maze] and [https://en.wikipedia

...ning]], and computer games with focus on [[Shogi]]. He is co-author of the Shogi program [[Mattari Yuuchan]] (afternoon), and the [https://en.wikipedia.org ...[[Nobuo Inui]], [[Yoshiyuki Kotani]] ('''2002'''). ''Effect of ProbCut in Shogi — by changing parameters according to position category''. [[Conferences#

...r Grimbergen]] on behalf of [[Takenobu Takizawa]], [[Computer Chess Forums|SHOGI-L]], February 03, 2019</ref>. ...ani]] ('''2006'''). ''Generation of Candidate Moves using Decision Tree in Shogi''. [[Conferences#GPW|11th Game Programming Workshop]]

...'). ''Comparison of Loss Functions for Training of Deep Neural Networks in Shogi''. [[TAAI 2018]] ...ys in many of the settings of the hyper-parameters. To our knowledge, this is the first research paper that applies the AlphaZero algorithm to non-determ

...iads]] <ref>[https://www.game-ai-forum.org/icga-tournaments/game.php?id=17 Shogi] at the [[Computer Olympiad]]</ref>, the [[Connect6]] program [https://www. ...to_Computer_Shogi Context Killer Heuristic and Its Application to Computer Shogi]''. [[CGW 2007]] » [[Killer Heuristic]]

As avocational games and chess programmer, Evert Glebbeek is author of the [[:Category:Open Source|open source engines]] [[Jazz]], [[Sja ...ert Glebbeek]], [[CCC]], October 20, 2014 » [[Sjaak (Glebbeek)|Sjaak]], [[Shogi]]

* [[Shogi]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=54092 Shogi] by [[Evert Glebbeek]], [[CCC]], October 20, 2014</ref> Despite boards exceeding 64 squares, like 10x8, 12x8, and 10x10, Sjaak is a native [[Bitboards|bitboard]] engine, utilizing either [[Free Software Fo

...igner on oil and gas projects, software developer and chess programmer. He is author of the chess engines [[Deuterium]] and [[CDrill]], the latter with t ...a]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=42106 Bihasa v3.0 is released] by [[Ferdinand Mosca]], [[CCC]], November 19, 2011</ref>,

...G|border|right|thumb| Timo Haupt takes a nap <ref>Operating [[GridGinkgo]] is exhausting and at times tiring - Timo Haupt takes a nap during the [[WCCC 2 Timo is chess player, computer chess aficionado, computer chess journalist in parti

...N clone rules] by [[Adam Treat]], [[CCC]], September 19, 2019</ref>. Allie is a replacement of [[Leela Chess Zero#Lc0|Lc0's]] search with an own implemen ...ww.patreon.com/jjosh Jjosh is creating Leelenstein | Patreon]</ref>, which is trained by [[Supervised Learning|supervised learning]] feeding in games fro

an American computer scientist and software engineer. He is a senior consulting engineer with [https://en.wikipedia.org/wiki/The_Qt_Com ...712.01815 arXiv:1712.01815]</ref> and the [[Leela Chess Zero]] project, he is author of the [[UCI]] compliant [[:Category:Open Source|open source chess e

...ns], [https://de.wikipedia.org/wiki/Unser_Fritz/Crange Unser Fritz/Crange] is further district of Herne (Wanne), famous for its funfair [https://en.wikip while '''Fat Fritz 2.0''' released in February 2021 is based on [[Stockfish NNUE|Stockfish 12]] and custom [[NNUE]] technology.

...e which is presumed to be the common ancestor of the games of [[Chess]], [[Shogi]] and [[Chinese Chess]] <ref>[https://en.wikipedia.org/wiki/History_of_ches

where he is author of the commercial program [https://en.wikipedia.org/wiki/Maven_%28Sc ...rg/pipermail/computer-go/2017-December/010583.html Re: Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm] by [[Brian Sh

.../YaneuraOu GitHub - yaneurao/YaneuraOu: YaneuraOu is the World's Strongest Shogi engine(AI player), WCSC29 1st winner, educational and USI compliant engine] ...http://www.talkchess.com/forum3/viewtopic.php?f=2&t=72754 The Stockfish of shogi] by [[Larry Kaufman]], [[CCC]], January 07, 2020</ref>.

...Network based Evaluation Functions for Computer Shogi''. Ziosoft Computer Shogi Club, [https://github.com/ynasu87/nnue/blob/master/docs/nnue.pdf pdf] (Japa .../YaneuraOu GitHub - yaneurao/YaneuraOu: YaneuraOu is the World's Strongest Shogi engine(AI player), WCSC29 1st winner, educational and USI compliant engine]

a Japanese computer scientist and [[Shogi]] programmer. =[[Shogi]]=

a Japanese mathematician, computer scientist, and computer [[Shogi]] and chess programmer, who introduced [[NNUE]] to [[Stockfish]], yielding =[[Shogi]]=

...mputer scientist, software engineer, and computer [[Shogi]] programmer. He is affiliated with the ''Machine Intelligence Laboratory'', [https://en.wikipe He is co-author of '''WebDNN''', an open source software framework for executing

a Japanese computer scientist, and computer [[Shogi]] programmer. He was affiliated with the ''Graduate School of Information S =[[Shogi]]=

YaneuraOu applies a Shogi adaptation of [[Stockfish|Stockfish's]] search, and can be combined with th

...telligence|artificial intelligence]], in particular, applied to computer [[Shogi]]. ...ing Workshops]] <ref>[http://www2.computer-shogi.org/index_e.html Computer Shogi Association Web Site]</ref>.

...ain Page|Home]] * [[Tournaments and Matches|Tournaments]] * World Computer Shogi Championship''' ...A| [[CSA]] logo <ref>[http://www2.computer-shogi.org/index_e.html Computer Shogi Association Web Site]</ref> ]]

...github.com/HiraokaTakuya/apery_rust GitHub - HiraokaTakuya/apery_rust: USI shogi engine written in Rust]</ref>. ...om/referenceworkentry/10.1007/978-3-319-08234-9_22-1 Contemporary Computer Shogi]''. [https://link.springer.com/referencework/10.1007/978-3-319-08234-9 Ency

'''USI''', (Universal Shogi Interface)<br/> ...en.wikipedia.org/wiki/Communication_protocol communication protocol] for [[Shogi]] playing engines to communicate with a [[GUI]].

an [[USI]] compliant [[:Category:Open Source|open source]] [[Shogi]] engine developed by [[Takuya Hiraoka]], ...github.com/HiraokaTakuya/apery_rust GitHub - HiraokaTakuya/apery_rust: USI shogi engine written in Rust]</ref>,

...aking this available for Chevrolet--the little "plug" about their vehicles is seen in the release. [https://commons.wikimedia.org/wiki/Category:Bonanza_( A MMTO predecessor, the initial '''Bonanza-Method''' was used in Hoki's [[Shogi]] engine [[Bonanza]] in 2006, winning the [[WCSC16]] <ref>[[Kunihito Hoki]]

an [[XBoard]] compliant [[:Category:Open Source|open source]] [[Shogi]] engine developed by primary author [[Kunihito Hoki]], started in 2004, at ...0 Participant List] by [[Takenobu Takizawa|Nobu]], [[Computer Chess Forums|SHOGI-L]], February 02, 2010</ref>.

...97%A5/ 将棋ソフト開発者がStockfishに貢献する日 The day when shogi software developers contribute to Stockfish] by [[Motohiro Isozaki]], June ...echnologies-in-shogi-ai-that-could-be-used-for-chess-ai/ 3 technologies in shogi AI that could be used for chess AI] by [[Motohiro Isozaki]], August 21, 202

a [[Shogi]] engine, or more precisely a Shogi evaluation function by team '''Barrel house''', a beer bar in front of the ...r Grimbergen]] on behalf of [[Takenobu Takizawa]], [[Computer Chess Forums|SHOGI-L]], February 03, 2019</ref>.

He is further co-author of the [https://en.wikipedia.org/wiki/Kanji Kanji] [https ...m/ynasu87/nnue/blob/master/docs/nnue.pdf pdf], [https://www.apply.computer-shogi.org/wcsc28/appeal/the_end_of_genesis_T.N.K.evolution_turbo_type_D/nnue.pdf

His current research focus is on [https://en.wikipedia.org/wiki/Sampling_%28statistics%29 sampling] algor ...9uuGm2GlFKh76wBilex7f8QvBiQecwiVmAvD6Bkyjx-rE MuZero: Mastering Go, chess, shogi and Atari without rules]</ref>.

...[[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://ar ...2/6419/1140 A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play]''. [https://en.wikipedia.org/wiki/Science_(journ

a Finnish IT freelancer, and computer games and computer chess programmer. He is author of multiple [[:Category:Open Source|open source]] chess and chess va the [[Shogi]] engine [[RubyShogi]], the chess variant engine [[Shuriken]], the [[Gothic

Chess is a [https://en.wikipedia.org/wiki/Two-player_game two-player] [https://en.wi ...and [[Pawn]] moves and captures in a distinct way. The object of the game is to [[Checkmate|checkmate]] the opponent's king.

...dvice is Useful for Game AI: Experiments with Alpha-Beta Search Players in Shogi''. [[Advances in Computer Games 16]]