Difference between revisions of "Arasan"

From Chessprogramming wiki
Jump to: navigation, search
m (added category MIT, engine itself is MIT license.)
 
(15 intermediate revisions by one other user not shown)
Line 12: Line 12:
 
|}
 
|}
  
=Bitboard Trials=  
+
=Selected Features=
 +
<ref>[https://www.arasanchess.org/programr.shtml Arasan Programmer's Guide]</ref>
 +
==[[Board Representation]]==
 +
===Bitboard Trials===
 
[[Jon Dart]], May 1996 <ref>[http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/d75cd258ea73a4a7 Arasan progress report] by [[Jon Dart]], [[Computer Chess Forums|rgcc]], May 23, 1996</ref>
 
[[Jon Dart]], May 1996 <ref>[http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/d75cd258ea73a4a7 Arasan progress report] by [[Jon Dart]], [[Computer Chess Forums|rgcc]], May 23, 1996</ref>
 
   Lately I've been working on a new major release of Arasan. I have spent the last few months working on the search engine, trying to improve speed and performance. I tried some experiments with a [[Bitboards|bitboard]] move representation, but I have backed off on that for now.
 
   Lately I've been working on a new major release of Arasan. I have spent the last few months working on the search engine, trying to improve speed and performance. I tried some experiments with a [[Bitboards|bitboard]] move representation, but I have backed off on that for now.
Line 20: Line 23:
 
  However, currently the program relies pretty heavily on [[Incremental Updates|incrementally generated]] [[Attack and Defend Maps|attack information]], and I didn't have that implemented to work with bitboards, so I had to compute attacks as needed. Unfortunately, the current program "needs" to do this much more often than [[Crafty]] does, so the loss from computing attacks more than balanced out the gains from bitboards. This is fixable, I'm sure, but I've put off further work on it for now.  
 
  However, currently the program relies pretty heavily on [[Incremental Updates|incrementally generated]] [[Attack and Defend Maps|attack information]], and I didn't have that implemented to work with bitboards, so I had to compute attacks as needed. Unfortunately, the current program "needs" to do this much more often than [[Crafty]] does, so the loss from computing attacks more than balanced out the gains from bitboards. This is fixable, I'm sure, but I've put off further work on it for now.  
  
=Magic Bitboards=  
+
===[[Magic Bitboards]]===
 
[[Jon Dart]], August 2008 <ref>[https://www.arasanchess.org/blogs/aug08.html Arasan Blog - Aug 26, 2008]</ref> :
 
[[Jon Dart]], August 2008 <ref>[https://www.arasanchess.org/blogs/aug08.html Arasan Blog - Aug 26, 2008]</ref> :
 
  The main change has been to re-work the code to use [[Magic Bitboards|"magic" bitboard logic]] instead of [[Rotated Bitboards|rotated bitboards]]. This has given about a 20-25% speedup. I have also had to re-write the [[Evaluation|evaluation function]] to take advantage of bitboard attack functions for [[King Safety|king safety]] and [[Mobility|mobility]].  
 
  The main change has been to re-work the code to use [[Magic Bitboards|"magic" bitboard logic]] instead of [[Rotated Bitboards|rotated bitboards]]. This has given about a 20-25% speedup. I have also had to re-write the [[Evaluation|evaluation function]] to take advantage of bitboard attack functions for [[King Safety|king safety]] and [[Mobility|mobility]].  
  
=PEXT/PDEP Bitboards=
+
===[[BMI2#PDEPBitboards|PEXT/PDEP Bitboards]]===
 
Arasan '''20.3''', released in November 2017, performs [[BMI2#PDEPBitboards|PEXT/PDEP Bitboards]] if compiled for the [[BMI2]] instruction set <ref>[http://www.talkchess.com/forum/viewtopic.php?t=65636 Arasan 20.3] by [[Jon Dart]], [[CCC]], November 05, 2017</ref> to replace [[Magic Bitboards#Fancy|Fancy Magic Bitboards]] in looking up [[Sliding Piece Attacks|sliding piece attacks]] <ref>arasan_source20.3.zip/src/attacks.h</ref>
 
Arasan '''20.3''', released in November 2017, performs [[BMI2#PDEPBitboards|PEXT/PDEP Bitboards]] if compiled for the [[BMI2]] instruction set <ref>[http://www.talkchess.com/forum/viewtopic.php?t=65636 Arasan 20.3] by [[Jon Dart]], [[CCC]], November 05, 2017</ref> to replace [[Magic Bitboards#Fancy|Fancy Magic Bitboards]] in looking up [[Sliding Piece Attacks|sliding piece attacks]] <ref>arasan_source20.3.zip/src/attacks.h</ref>
 +
 
<span id="Tuning"></span>
 
<span id="Tuning"></span>
=Automated Tuning=
+
==[[Search]]==
Arasan '''19.2''', released in November 2016, now applies [[Texel's Tuning Method]] by default and supports the ''Adam'' [https://en.wikipedia.org/wiki/Gradient_descent gradient descent] algorithm  <ref>[http://www.talkchess.com/forum/viewtopic.php?t=61948 Arasan 19.2] by [[Jon Dart]], [[CCC]], November 03, 2016</ref> <ref>[https://scholar.google.nl/citations?user=yyIoQu4AAAAJ Diederik P. Kingma], [https://scholar.google.ca/citations?user=ymzxRhAAAAAJ&hl=en Jimmy Lei Ba] ('''2015'''). ''Adam: A Method for Stochastic Optimization''. [https://arxiv.org/abs/1412.6980v8 arXiv:1412.6980v8], [http://www.iclr.cc/doku.php?id=iclr2015:main ICLR 2015]</ref>.  
+
* [[Lazy SMP]] 21.0
 
+
* [[Iterative Deepening]] [[Depth#FractionalPlies|Depth Resolution 4]]
=Lazy SMP=
+
* [[Aspiration Windows]]
As of version 21.0 in June 2018 Arasan comes with a [[Lazy SMP]] implementation.
+
* [[Principal Variation Search]]
 +
* [[Transposition Table]]
 +
** [[Shared Hash Table]]
 +
** [[Shared Hash Table#Lockless|Lockless Hashing]]
 +
* [[Move Ordering]]
 +
** [[Internal Iterative Deepening]]
 +
** [[Countermove Heuristic]]
 +
** [[History Heuristic#CMHist|Counter Moves History]]
 +
** [[Killer Heuristic]]
 +
** [[Refutation Table]]
 +
** [[History Heuristic]]
 +
** [[MVV-LVA|MVV/LVA]]
 +
** [[Static Exchange Evaluation|SEE]]
 +
* [[Selectivity]]
 +
** [[Depth#FractionalPlies|Fractional Ply]] [[Extensions]]
 +
*** [[Check Extensions]]
 +
*** [[Passed Pawn Extensions]]
 +
*** [[Singular Extensions]]
 +
** [[Pruning]]
 +
*** [[Null Move Pruning]]
 +
*** [[Reverse Futility Pruning|Static Null Move Pruning]]
 +
*** [[Static Exchange Evaluation|SEE Pruning]]
 +
*** [[Futility Pruning]]
 +
***  [[Futility Pruning#MoveCountBasedPruning|Late Move Pruning]]
 +
*** [[ProbCut]]
 +
** [[Reductions]]
 +
*** [[Late Move Reductions]]
 +
*** [[Razoring]]
 +
** [[Quiescence Search]]
 +
==[[Evaluation]]==
 +
===[[NNUE]]===
 +
Arasan '''23.0''', released in September 2021, uses a [[Stockfish]] 13 compatible [[NNUE]] - trained by selfplay positions - to [[Evaluation|evaluate]] its positions <ref>[https://www.talkchess.com/forum3/viewtopic.php?f=2&t=78122&start=14 Re: Arasan 23.0] by [[Jon Dart]], [[CCC]], September 08, 2021</ref>. The neural network file is external to the program and is loaded at runtime.
 +
===Traditional===
 +
* [[Material]]
 +
* [[Piece-Square Tables]]
 +
* [[Development]]
 +
* [[Mobility]]
 +
** [[Trapped Pieces]]
 +
** [[Rook on Open File|Rooks on (Semi) Open Files]]
 +
* [[Outposts]]
 +
* [[Pawn Structure]]
 +
** [[Pawn Hash Table]]
 +
** [[Backward Pawn]]
 +
** [[Doubled Pawn]]
 +
** [[Isolated Pawn]]
 +
* [[Passed Pawn]]
 +
** [[Connected Passed Pawns]]
 +
** [[Outside Passed Pawn]]
 +
** [[Blockade of Stop]]
 +
** [[Tarrasch Rule]]
 +
* [[King Safety]]
 +
** [[King Safety#KingTropism|King Tropism]]
 +
** [[King Safety#PawnShield|Pawn Shelter]]
 +
** [[King Safety#PawnStorm|Pawn Storm]]
 +
===[[Automated Tuning]]===
 +
Arasan '''19.2''', released in November 2016, applies [[Texel's Tuning Method]] by default and supports the [https://en.wikipedia.org/wiki/Stochastic_gradient_descent#Adam Adam] [https://en.wikipedia.org/wiki/Gradient_descent gradient descent] algorithm  <ref>[http://www.talkchess.com/forum/viewtopic.php?t=61948 Arasan 19.2] by [[Jon Dart]], [[CCC]], November 03, 2016</ref> <ref>[https://scholar.google.nl/citations?user=yyIoQu4AAAAJ Diederik P. Kingma], [https://scholar.google.ca/citations?user=ymzxRhAAAAAJ&hl=en Jimmy Lei Ba] ('''2015'''). ''Adam: A Method for Stochastic Optimization''. [https://arxiv.org/abs/1412.6980v8 arXiv:1412.6980v8], [http://www.iclr.cc/doku.php?id=iclr2015:main ICLR 2015]</ref>.  
 +
==[[Syzygy Bases]]==
 +
Arasan uses a [[Syzygy Bases#Fathom|Fathom]] fork with some bug fixes and enhancements <ref>[https://github.com/jdart1/Fathom jdart1/Fathom · GitHub] by [[Jon Dart]]</ref>, also supporting [[Syzygy Bases#7-man|7-man]] <ref>[http://www.talkchess.com/forum3/viewtopic.php?f=7&t=70568 7-man Syzygy support in Fathom] by [[Jon Dart]], [[CCC]], April 23, 2019</ref>.
  
 
=Tournament Play=  
 
=Tournament Play=  
Arasan went online in December, 1996 <ref>[http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/4a4705301c3c3229 Arasan goes online] by [[Jon Dart]], [[Computer Chess Forums|rgcc]], January 6, 1997</ref> , and played almost all major online computer chess tournaments, such as [[CCT Tournaments]], [[ACCA Americas' Computer Chess Championship]], [[ACCA World Computer Rapid Chess Championship]], [[TCEC]], and [[Italian Computer Chess Championship#IGWT|International Gsei Web Tournaments]]. Arasan 15.1 <ref>[http://www.talkchess.com/forum/viewtopic.php?t=46077 Arasan 15.1] by [[Jon Dart]], [[CCC]], November 19, 2012</ref> won the [[ACCA 2012]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=46047 Seventh Annual ACCA Americas' Computer Chess Championships] by [[Jon Dart]], [[CCC]], November 18, 2012</ref> , Arasan 16.0 the [[WCRCC 2013]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=48703 Arasan games from WCRCC] by [[Jon Dart]], [[CCC]], July 21, 2013</ref> . Over the board, Arasan is active at the [[CSVN Programmers Tournament|CSVN Programmers Tournaments]] operated by [[Tessa Pijl]]. Arasan was runner-up behind [[The Baron]] in May 2014 at the [[PT 46]] one point behind, as well in June 2015 at the [[PT 48]] with the same score according to the tiebreak rules <ref>[http://www.talkchess.com/forum/viewtopic.php?t=56645&start=3 Baron 1st, Arasan 2nd] by [[Jon Dart]], [[CCC]], June 14, 2015</ref>.
+
Arasan went online in December, 1996 <ref>[http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/4a4705301c3c3229 Arasan goes online] by [[Jon Dart]], [[Computer Chess Forums|rgcc]], January 6, 1997</ref> , and played almost all major online computer chess tournaments, such as [[CCT Tournaments]], [[ACCA Americas' Computer Chess Championship]], [[ACCA World Computer Rapid Chess Championship]], [[TCEC]], and [[Italian Computer Chess Championship#IGWT|International Gsei Web Tournaments]]. Arasan 15.1 <ref>[http://www.talkchess.com/forum/viewtopic.php?t=46077 Arasan 15.1] by [[Jon Dart]], [[CCC]], November 19, 2012</ref> won the [[ACCA 2012]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=46047 Seventh Annual ACCA Americas' Computer Chess Championships] by [[Jon Dart]], [[CCC]], November 18, 2012</ref> , Arasan 16.0 the [[WCRCC 2013]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=48703 Arasan games from WCRCC] by [[Jon Dart]], [[CCC]], July 21, 2013</ref> . Over the board, Arasan was active at the [[CSVN Programmers Tournament|CSVN Programmers Tournaments]] operated by [[Tessa Pijl]]. Arasan was runner-up behind [[The Baron]] in May 2014 at the [[PT 46]] one point behind, as well in June 2015 at the [[PT 48]] with the same score according to the tiebreak rules <ref>[http://www.talkchess.com/forum/viewtopic.php?t=56645&start=3 Baron 1st, Arasan 2nd] by [[Jon Dart]], [[CCC]], June 14, 2015</ref>.
  
 
=Photos & Games=
 
=Photos & Games=
Line 161: Line 222:
 
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=67855 Arasan 21.0] by [[Jon Dart]], [[CCC]], June 30, 2018
 
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=67855 Arasan 21.0] by [[Jon Dart]], [[CCC]], June 30, 2018
 
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68554 Arasan 21.1] by [[Jon Dart]], [[CCC]], October 02, 2018
 
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68554 Arasan 21.1] by [[Jon Dart]], [[CCC]], October 02, 2018
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=69436 Arasan 21.2] by [[Jon Dart]], [[CCC]], December 31, 2018
 +
'''2019'''
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=70360 Arasan 21.3] by [[Jon Dart]], [[CCC]], March 29, 2019
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=71169 Arasan 21.4] by [[Jon Dart]], [[CCC]], July 02, 2019
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=72541 Arasan 22.0] by [[Jon Dart]], [[CCC]], December 10, 2019
 +
==2020 ...==
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=74331 Arasan 22.1] by [[Jon Dart]], [[CCC]], July 01, 2020
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=76128 Arasan 22.2] by [[Jon Dart]], [[CCC]], December 22, 2020
 +
'''2021'''
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=77414 Arasan 22.3] by [[Jon Dart]], [[CCC]],  May 31, 2021
 +
* [https://www.talkchess.com/forum3/viewtopic.php?f=2&t=78122 Arasan 23.0] by [[Jon Dart]], [[CCC]], September 06, 2021
 +
: [https://www.talkchess.com/forum3/viewtopic.php?f=2&t=78122&start=14 Re: Arasan 23.0] by [[Jon Dart]], [[CCC]], September 08, 2021
 +
'''2022'''
 +
* [https://www.talkchess.com/forum3/viewtopic.php?f=2&t=79500 Arasan 23.3] by [[Jon Dart]], [[CCC]], March 12, 2022
  
 
=External Links=  
 
=External Links=  
 
==Chess Engine==  
 
==Chess Engine==  
* [https://arasanchess.org/index.shtml Arasan Chess] by [[Jon Dart]]
+
* [https://github.com/jdart1/arasan-chess jdart1/arasan-chess · GitHub] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=48082 Arasan on github] by [[Jon Dart]], [[CCC]], May 22, 2013</ref>
* [https://arasanchess.org/programr.shtml Arasan Programmer's Guide] by [[Jon Dart]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=64364 Arasan Programmer's Guide] by [[Jon Dart]], [[CCC]], June 21, 2017</ref>
+
* [https://www.arasanchess.org/index.shtml Arasan Chess] by [[Jon Dart]]
 +
* [https://www.arasanchess.org/programr.shtml Arasan Programmer's Guide] by [[Jon Dart]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=64364 Arasan Programmer's Guide] by [[Jon Dart]], [[CCC]], June 21, 2017</ref>
 
* [https://www.arasanchess.org/testsuite.shtml Arasan Test Suite]
 
* [https://www.arasanchess.org/testsuite.shtml Arasan Test Suite]
* [http://www.playwitharena.com/?Newsticker:Archive_5 Arasan 8.4 released, short interview with Jon Dart] by [[Frank Quisinsky]], March 01, 2005, [[Arena|Arena Chess GUI]], Archive 5, 72
+
* [https://web.archive.org/web/20120106012659/http://www.playwitharena.com/?Newsticker:Archive_5 Arasan 8.4 released, short interview with Jon Dart] by [[Frank Quisinsky]], March 01, 2005, [[Arena|Arena Chess GUI]], Archive 5, 72 ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine])
* [https://github.com/jdart1/arasan-chess jdart1/arasan-chess · GitHub] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=48082 Arasan on github] by [[Jon Dart]], [[CCC]], May 22, 2013</ref>
+
* [http://www.computerchess.org.uk/ccrl/4040/cgi/compare_engines.cgi?family=Arasan&print=Rating+list&print=Results+table&print=LOS+table&print=Ponder+hit+table&print=Eval+difference+table&print=Comopp+gamenum+table&print=Overlap+table&print=Score+with+common+opponents Arasan] in [[CCRL|CCRL 40/15]]
* [http://www.computerchess.org.uk/ccrl/4040/cgi/engine_details.cgi?match_length=30&each_game=1&print=Details&each_game=1&eng=Arasan%2017.0%2064-bit#Arasan_17_0_64-bit Arasan 17.0 64-bit] in [[CCRL|CCRL 40/40]]
 
* [http://www.computerchess.org.uk/ccrl/4040/cgi/engine_details.cgi?match_length=30&each_game=1&print=Details&each_game=1&eng=Arasan%2018.0%2064-bit%204CPU#Arasan_18_0_64-bit_4CPU Arasan 18.0 64-bit] in [[CCRL|CCRL 40/40]]
 
 
==Misc==  
 
==Misc==  
 
* [https://en.wikipedia.org/wiki/Arasan Arasan from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Arasan Arasan from Wikipedia]
Line 179: Line 253:
  
 
'''[[Engines|Up one Level]]'''
 
'''[[Engines|Up one Level]]'''
[[Category:Chess Pieces]]
+
[[Category:Open Source]]
 +
[[Category:MIT]]
 
[[Category:Nobility]]
 
[[Category:Nobility]]
 
[[Category:UCI]]
 
[[Category:UCI]]
 
[[Category:WinBoard‏‎]]
 
[[Category:WinBoard‏‎]]
 
[[Category:XBoard‏‎]]
 
[[Category:XBoard‏‎]]
[[Category:Open Source]]
+
[[Category:X86]]
 +
[[Category:X64]]
 +
[[Category:PC]]
 +
[[Category:ARM]]
 +
[[Category:Pi]]
 +
[[Category:Android]]
 +
[[Category:Linux]]
 +
[[Category:Mac]]
 +
[[Category:Windows]]
 +
[[Category:NNUE]]
 +
[[Category:Chess Pieces]]

Latest revision as of 10:03, 10 May 2023

Home * Engines * Arasan

Arasan,

an open source engine written by Jon Dart in C++. Arasan's development started in the early 90s, the first version, released in 1994 was a 16-bit program running under Windows 3.1 using an 8x8 Board, incremental updated attack tables and its own GUI, evolving to a portable 32-bit and later 64-bit program, utilizing bitboards to determine its sliding piece attacks with rotated bitboard lookups. In 2008, rotated were replaced by Magic bitboards, which gave Arasan about a 20-25% speedup [1].

Despite its own GUI, Arasan early supported the Chess Engine Communication Protocol and later UCI as well, to run under Windows, Linux and Mac OS [2]. The latest version of Arasan and all major versions, including Version 1.0 from March 1994, are available as source code from the Arasan.org site [3] . Jon's change logs, bug fix reports and tournament reports over the time are available from forum archives, as well the recent ones from the Arasan blog [4]

அரசன்
அரசன் [5] (Arasan) , King in Tamil language [6]

Selected Features

[7]

Board Representation

Bitboard Trials

Jon Dart, May 1996 [8]

 Lately I've been working on a new major release of Arasan. I have spent the last few months working on the search engine, trying to improve speed and performance. I tried some experiments with a bitboard move representation, but I have backed off on that for now.
With bitboards, I got a nice reduction in tree size (bitboards allow a more accurate swap-down analysis than I had before, and this improves move ordering and allows better "culling" of losing captures in the quiescence search).
However, currently the program relies pretty heavily on incrementally generated attack information, and I didn't have that implemented to work with bitboards, so I had to compute attacks as needed. Unfortunately, the current program "needs" to do this much more often than Crafty does, so the loss from computing attacks more than balanced out the gains from bitboards. This is fixable, I'm sure, but I've put off further work on it for now. 

Magic Bitboards

Jon Dart, August 2008 [9] :

The main change has been to re-work the code to use "magic" bitboard logic instead of rotated bitboards. This has given about a 20-25% speedup. I have also had to re-write the evaluation function to take advantage of bitboard attack functions for king safety and mobility. 

PEXT/PDEP Bitboards

Arasan 20.3, released in November 2017, performs PEXT/PDEP Bitboards if compiled for the BMI2 instruction set [10] to replace Fancy Magic Bitboards in looking up sliding piece attacks [11]

Search

Evaluation

NNUE

Arasan 23.0, released in September 2021, uses a Stockfish 13 compatible NNUE - trained by selfplay positions - to evaluate its positions [12]. The neural network file is external to the program and is loaded at runtime.

Traditional

Automated Tuning

Arasan 19.2, released in November 2016, applies Texel's Tuning Method by default and supports the Adam gradient descent algorithm [13] [14].

Syzygy Bases

Arasan uses a Fathom fork with some bug fixes and enhancements [15], also supporting 7-man [16].

Tournament Play

Arasan went online in December, 1996 [17] , and played almost all major online computer chess tournaments, such as CCT Tournaments, ACCA Americas' Computer Chess Championship, ACCA World Computer Rapid Chess Championship, TCEC, and International Gsei Web Tournaments. Arasan 15.1 [18] won the ACCA 2012 [19] , Arasan 16.0 the WCRCC 2013 [20] . Over the board, Arasan was active at the CSVN Programmers Tournaments operated by Tessa Pijl. Arasan was runner-up behind The Baron in May 2014 at the PT 46 one point behind, as well in June 2015 at the PT 48 with the same score according to the tiebreak rules [21].

Photos & Games

ArasanTheKingPT48.jpg

PT 48, Two Kings fighting, Johan de Koning and Tessa Pijl in Arasan vs. The King [22]

[Event "PT 48"]
[Site "Leiden, NL"]
[Date "2015.06.14"]
[Round "7"]
[White "Arasan"]
[Black "The King"]
[Result "1-0"]

1.d4 d5 2.c4 c6 3.Nf3 Nf6 4.Nc3 e6 5.e3 Nbd7 6.Bd3 dxc4 7.Bxc4 b5 8.Bd3 a6 
9.a4 b4 10.Ne4 c5 11.Nxf6+ Nxf6 12.dxc5 Bxc5 13.e4 Bb7 14.Qe2 O-O 15.O-O e5 
16.Bg5 h6 17.Bh4 Qd6 18.Bg3 Rfe8 19.Rfd1 Re7 20.Bh4 Qc6 21.Rac1 Rc8 22.Rc4 Re6 
23.Bxf6 Rxf6 24.Rdc1 Qb6 25.Kh1 a5 26.Qc2 b3 27.Qe2 Qd6 28.R4c3 Rf4 29.g3 Rf6 
30.Bc4 Rb8 31.Rxb3 Bb4 32.Rd3 Qc7 33.Kg2 Rf8 34.Rdd1 Rc6 35.b3 Re8 36.Kg1 Rc8 
37.Rd5 Re6 38.Rd3 Rf6 39.Rcd1 Re8 40.Nh4 Qb6 41.Nf5 Rf8 42.Rf3 Kh8 43.Nh4 Kg8 
44.Rd7 Bc8 45.Rd5 Rd6 46.Rxd6 Qxd6 47.Rd3 Qc7 48.Qh5 Kh7 49.Nf3 f6 50.Nh4 Bd7 
51.Bf7 Bc8 52.Bg6+ Kg8 53.Bf5 Qc2 54.Qf3 Re8 55.Kg2 Rf8 56.Rd5 Bc5 57.Bxc8 Rxc8 
58.Rd7 Bf8 59.Qg4 h5 60.Qg6 Qe2 61.Nf3 Qc2 62.Qf7+ Kh8 63.Qxh5+ Kg8 64.Nd2 Rb8 
65.g4 Rc8 66.Qf7+ Kh8 67.Qh5+ Kg8 68.Qg6 Kh8 69.Qf5 Kg8 70.g5 fxg5 71.Nf3 Qc6 
72.Nxg5 Qh6 73.Rd3 Rc7 74.Rf3 Bb4 75.Rh3 Bf8 76.Rxh6 1-0

See also

Forum Posts

1995 ...

2000 ...

2005 ...

2010 ...

2011

2012

2013

2014

2015 ...

2016

2017

2018

2019

2020 ...

2021

Re: Arasan 23.0 by Jon Dart, CCC, September 08, 2021

2022

External Links

Chess Engine

Misc

References

Up one Level