25,161
edits
Changes
Created page with "'''Home * People * Uri Blass''' FILE:shredder_movei.jpg|border|right|thumb|link=http://www.shredderchess.de/schach-news/shredder-news/telaviv2004.html| U..."
'''[[Main Page|Home]] * [[People]] * Uri Blass'''
[[FILE:shredder_movei.jpg|border|right|thumb|link=http://www.shredderchess.de/schach-news/shredder-news/telaviv2004.html| Uri Blass and [[Stefan Meyer-Kahlen]], [[WCCC 2004]] <ref>[http://www.shredderchess.de/schach-news/shredder-news/telaviv2004.html Computerschach Weltmeisterschaft in Tel Aviv] from [http://www.shredderchess.de/ shredderchess.de] (German)</ref> ]]
'''Uri Blass''',<br/>
an Israeli mathematician, chess and [https://en.wikipedia.org/wiki/Correspondence_chess correspondence chess] player, and computer chess programmer.
Uri Blass received his Ph.D. in [https://en.wikipedia.org/wiki/Discrete_mathematics discrete mathematics] at [https://en.wikipedia.org/wiki/Tel_Aviv_University Tel Aviv University] in 2002 on the topic of [https://en.wikipedia.org/wiki/Hamming_bound Hamming bounds] in [https://en.wikipedia.org/wiki/Coding_theory coding theory] under advisor [[Mathematician#SLitsyn|Simon Litsyn]] <ref>[https://www.eng.tau.ac.il/~litsyn/taucv08.pdf Simon Litsyn, Ph.D CV] (pdf)</ref>.
In 2011, Uri Blass was awarded with the [https://en.wikipedia.org/wiki/International_Correspondence_Chess_Grandmaster International Correspondence Chess Grand Master] title by the [https://en.wikipedia.org/wiki/International_Correspondence_Chess_Federation ICCF] <ref>[https://www.iccf.com/PlayerDetails.aspx?id=270233 ICCF Player Details - Uri Blass]</ref>.
As active poster in [[Computer Chess Forums]], Uri asked first questions on how to develop a chess program in the late 90s <ref>[https://www.stmintz.com/ccc/index.php?id=16921 how to develop a chess program?] by [[Uri Blass]], [[CCC]], April 14, 1998</ref>, and became an [https://en.wikipedia.org/wiki/Autodidacticism autodidact] chess programmer, to release his chess engine [[Movei]] in 2002 <ref>[https://www.stmintz.com/ccc/index.php?id=229271 my program movei is released] by [[Uri Blass]], [[CCC]], May 12, 2002</ref>.
More recently, Uri Blass contributed to the [[Stockfish]] development <ref>[https://github.com/official-stockfish/Stockfish/issues/1380 Stockfish: call for contributor's full name :-) · Issue #1380 · official-stockfish/Stockfish · GitHub]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/b/Blass:Uri.html dblp: Uri Blass]</ref>
==1990 ...==
* [[Uri Blass]], [[Aviezri Fraenkel]] ('''1990'''). ''The Sprague-Grundy Function for Wythoff's Game''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 75, No 3. <ref>[https://en.wikipedia.org/wiki/Sprague%E2%80%93Grundy_theorem Sprague–Grundy theorem from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Wythoff%27s_game Wythoff's game from Wikipedia]</ref>
* [[Uri Blass]], [[Mathematician#SLitsyn|Simon Litsyn]] ('''1998'''). ''[https://ieeexplore.ieee.org/document/705582 Several new lower bounds on the size of codes with covering radius one]''. [[IEEE#TIT|IEEE Transactions on Information Theory]], Vol. 44, No. 5
* [[Uri Blass]], [[Mathematician#SLitsyn|Simon Litsyn]] ('''1998'''). ''Several new lower bounds for football pool systems''. [https://en.wikipedia.org/wiki/Ars_Combinatoria_(journal) Ars Combinatoria], Vol. 50, [https://pdfs.semanticscholar.org/8ba2/840086bd1f91780087e2b3c81eab9fee9689.pdf pdf]
* [[Uri Blass]], [[Aviezri Fraenkel]], [https://dblp.uni-trier.de/pers/hd/g/Guelman:Romina Romina Guelman] ('''1998'''). ''How Far Can Nim in Disguise be Stretched?'' [https://en.wikipedia.org/wiki/Journal_of_Combinatorial_Theory Journal of Combinatorial Theory], Series A, Vol. 84, [https://arxiv.org/abs/math/9809079 arXiv:math/9809079]
* [[Uri Blass]], [[Mathematician#JHonkala|Iiro Honkala]], [[Mathematician#SLitsyn|Simon Litsyn]] ('''1999'''). ''[https://link.springer.com/chapter/10.1007/3-540-46796-3_14 On the Size of Identifying Codes]''. [https://dblp.uni-trier.de/db/conf/aaecc/aaecc1999.html AAECC 1999], [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Uri Blass]], [[Mathematician#SLitsyn|Simon Litsyn]] ('''1999'''). ''The smallest covering code of length 8 and radius 2 has 12 words''. [https://en.wikipedia.org/wiki/Ars_Combinatoria_(journal) Ars Combinatoria], Vol. 52, [https://pdfs.semanticscholar.org/d94d/c4d1386e9b5fd19c8b352d9c2a991da5efbc.pdf pdf]
==2000 ...==
* [[Uri Blass]], [[Mathematician#JHonkala|Iiro Honkala]], [[Mathematician#SLitsyn|Simon Litsyn]] ('''2000'''). ''[https://onlinelibrary.wiley.com/doi/abs/10.1002/%28SICI%291520-6610%282000%298%3A2%3C151%3A%3AAID-JCD8%3E3.0.CO%3B2-S On binary codes for identification]''. [https://onlinelibrary.wiley.com/toc/15206610/2000/8/2 Journal of Combinatorial Designs, Vol. 8, No. 2]
* [https://users.aalto.fi/~pat/ Patric R. J. Östergård], [[Uri Blass]] ('''2001'''). ''[https://ieeexplore.ieee.org/document/945268 On the size of optimal binary codes of length 9 and covering radius 1]''. [[IEEE#TIT|IEEE Transactions on Information Theory]], Vol. 47, No. 6
* [[Uri Blass]], [[Mathematician#JHonkala|Iiro Honkala]], [https://dblp.uni-trier.de/pers/hd/k/Karpovsky:Mark_G= Mark G. Karpovsky], [[Mathematician#SLitsyn|Simon Litsyn]] ('''2001'''). ''[https://link.springer.com/article/10.1007/PL00001292 Short Dominating Paths and Cycles in the Binary Hypercube]''. [http://www.combinatorics.net/ Annals of Combinatorics], Vol. 5, No. 10
* [[Uri Blass]], [[Mathematician#JHonkala|Iiro Honkala]], [[Mathematician#SLitsyn|Simon Litsyn]] ('''2001'''). ''[https://www.sciencedirect.com/science/article/pii/S0012365X01001133 Bounds on identifying codes]''. [https://en.wikipedia.org/wiki/Discrete_Mathematics_(journal) Discrete Mathematics], Vol. 241, Nos. 1–3
* [[Uri Blass]] ('''2002'''). ''Bounds on Covering Codes''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Tel_Aviv_University Tel Aviv University], advisor [[Mathematician#SLitsyn|Simon Litsyn]]
=Forum Posts=
==1998 ...==
* [https://www.stmintz.com/ccc/index.php?id=16367 some questions about computer chess programs] by [[Uri Blass]], [[CCC]], April 01, 1998
* [https://www.stmintz.com/ccc/index.php?id=16921 how to develop a chess program?] by [[Uri Blass]], [[CCC]], April 14, 1998
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=226258 question about book and learning] by [[Uri Blass]], [[CCC]], April 26, 2002
* [https://www.stmintz.com/ccc/index.php?id=229271 my program movei is released] by [[Uri Blass]], [[CCC]], May 12, 2002
* [https://www.stmintz.com/ccc/index.php?id=235364 Re: Did Uri write movei? (yes)] by [[Uri Blass]], [[CCC]], June 13, 2002
: [https://www.stmintz.com/ccc/index.php?id=235379 Re: Did Uri write movei? (yes)] by [[Dann Corbit]], [[CCC]], June 13, 2002
* [https://www.stmintz.com/ccc/index.php?id=292140 some questions about chess programs and money] by [[Uri Blass]], [[CCC]], April 07, 2003
* [http://www.talkchess.com/forum/viewtopic.php?t=13673 About pawn hash tables] by [[Uri Blass]], [[CCC]], May 10, 2007 » [[Pawn Hash Table]]
* [http://www.talkchess.com/forum/viewtopic.php?t=13800 a beat b,b beat c,c beat a question] by [[Uri Blass]], [[CCC]], May 16, 2007 » [[Engine Testing]], [[Playing Strength]]
* [http://www.talkchess.com/forum/viewtopic.php?t=13969 question about symmertic evaluation] by [[Uri Blass]], [[CCC]], May 23, 2007 » [[Evaluation]]
* [http://www.talkchess.com/forum/viewtopic.php?t=15505 fail high handling with tranposition tables] by [[Uri Blass]], [[CCC]], August 01, 2007 » [[Transposition Table]]
* [http://www.talkchess.com/forum/viewtopic.php?t=16414 discovered check definition] by [[Uri Blass]], [[CCC]], September 12, 2007 » [[Discovered Check]]
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=47161 important ideas in chess programming] by [[Uri Blass]], [[CCC]], February 08, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=51129 fixing the null move search "bug"] by [[Uri Blass]], [[CCC]], February 01, 2014 » [[Null Move Pruning]], [[Stockfish]]
* [http://www.talkchess.com/forum/viewtopic.php?t=58882 Using more than 1 thread in C beginner question] by [[Uri Blass]], [[CCC]], January 11, 2016 » [[C]], [[Thread]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65403 comparing between search or evaluation] by [[Uri Blass]], [[CCC]], October 09, 2017 » [[Evaluation]], [[Search]]
'''2018'''
* [http://www.talkchess.com/forum/viewtopic.php?t=66413 replace the evaluation by playing against yourself] by [[Uri Blass]], [[CCC]], January 25, 2018 » [[Evaluation]], [[Fortress]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66680 Is there a program to build opening books based on engines?] by [[Uri Blass]], [[CCC]], February 23, 2018 » [[Opening Book]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66686 about using winboard] by [[Uri Blass]], [[CCC]], February 25, 2018 » [[WinBoard]]
* [http://www.talkchess.com/forum/viewtopic.php?t=67013 What does LCzero learn?] by [[Uri Blass]], [[CCC]], April 05, 2018 » [[Leela Chess Zero]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=67790 analysis of 1.e4 e5 2.Nf3 f6] by [[Uri Blass]], [[CCC]], June 22, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68100 mate test positions] by [[Uri Blass]], [[CCC]], July 29, 2018 » [[Checkmate]], [[Test-Positions]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68146 A mate suite to test multi-pv and new engines] by [[Uri Blass]], [[CCC]], August 06, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68340 stockfish increasing returns with low nodes] by [[Uri Blass]], [[CCC]], August 31, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68469 evaluation and scaling] by [[Uri Blass]], [[CCC]], September 19, 2018 » [[Fortress]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68657 Test the combinational vision of your engine] by [[Uri Blass]], [[CCC]], October 15, 2018 » [[Combination]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68760 abstract fairy pieces] by [[Uri Blass]], [[CCC]], October 29, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=68805 rewrite generating a new chess project] by [[Uri Blass]], [[CCC]], November 02, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=69199 Are opening principles correct?] by [[Uri Blass]], [[CCC]], December 09, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=69408 translating chess material and author's right] by [[Uri Blass]], [[CCC]], December 29, 2018
'''2019'''
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=69699 a test position that I composed] by [[Uri Blass]], [[CCC]], January 24, 2019
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=69750 changing the 50 move rule to 5 move rule] by [[Uri Blass]], [[CCC]], January 28, 2019 » [[Fifty-move Rule]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=70115 can stockfish with book beat leela without book?] by [[Uri Blass]], [[CCC]], March 06, 2019 » [[Stockfish]], [[Leela Chess Zero]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=71081 evaluation that usually go up when you are winning] by [[Uri Blass]], [[CCC]], June 24, 2019
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=71127 Are there tools to create opening books] by [[Uri Blass]], [[CCC]], June 28, 2019
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=91 Uri Blass' ICGA Tournaments]
* [http://netanyachess.com/player/5824/en Uri Blass] from [http://netanyachess.com/Index.aspx?Language=en Netanya Chess Club]
* [https://ratings.fide.com/card.phtml?event=2803968 Blass, Uri FIDE Chess Profile]
* [https://www.iccf.com/PlayerDetails.aspx?id=270233 ICCF Player Details - Uri Blass]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Blass]]
[[Category:Chess Player|Blass]]
[[Category:Chess Programmer|Blass]]
[[FILE:shredder_movei.jpg|border|right|thumb|link=http://www.shredderchess.de/schach-news/shredder-news/telaviv2004.html| Uri Blass and [[Stefan Meyer-Kahlen]], [[WCCC 2004]] <ref>[http://www.shredderchess.de/schach-news/shredder-news/telaviv2004.html Computerschach Weltmeisterschaft in Tel Aviv] from [http://www.shredderchess.de/ shredderchess.de] (German)</ref> ]]
'''Uri Blass''',<br/>
an Israeli mathematician, chess and [https://en.wikipedia.org/wiki/Correspondence_chess correspondence chess] player, and computer chess programmer.
Uri Blass received his Ph.D. in [https://en.wikipedia.org/wiki/Discrete_mathematics discrete mathematics] at [https://en.wikipedia.org/wiki/Tel_Aviv_University Tel Aviv University] in 2002 on the topic of [https://en.wikipedia.org/wiki/Hamming_bound Hamming bounds] in [https://en.wikipedia.org/wiki/Coding_theory coding theory] under advisor [[Mathematician#SLitsyn|Simon Litsyn]] <ref>[https://www.eng.tau.ac.il/~litsyn/taucv08.pdf Simon Litsyn, Ph.D CV] (pdf)</ref>.
In 2011, Uri Blass was awarded with the [https://en.wikipedia.org/wiki/International_Correspondence_Chess_Grandmaster International Correspondence Chess Grand Master] title by the [https://en.wikipedia.org/wiki/International_Correspondence_Chess_Federation ICCF] <ref>[https://www.iccf.com/PlayerDetails.aspx?id=270233 ICCF Player Details - Uri Blass]</ref>.
As active poster in [[Computer Chess Forums]], Uri asked first questions on how to develop a chess program in the late 90s <ref>[https://www.stmintz.com/ccc/index.php?id=16921 how to develop a chess program?] by [[Uri Blass]], [[CCC]], April 14, 1998</ref>, and became an [https://en.wikipedia.org/wiki/Autodidacticism autodidact] chess programmer, to release his chess engine [[Movei]] in 2002 <ref>[https://www.stmintz.com/ccc/index.php?id=229271 my program movei is released] by [[Uri Blass]], [[CCC]], May 12, 2002</ref>.
More recently, Uri Blass contributed to the [[Stockfish]] development <ref>[https://github.com/official-stockfish/Stockfish/issues/1380 Stockfish: call for contributor's full name :-) · Issue #1380 · official-stockfish/Stockfish · GitHub]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/b/Blass:Uri.html dblp: Uri Blass]</ref>
==1990 ...==
* [[Uri Blass]], [[Aviezri Fraenkel]] ('''1990'''). ''The Sprague-Grundy Function for Wythoff's Game''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 75, No 3. <ref>[https://en.wikipedia.org/wiki/Sprague%E2%80%93Grundy_theorem Sprague–Grundy theorem from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Wythoff%27s_game Wythoff's game from Wikipedia]</ref>
* [[Uri Blass]], [[Mathematician#SLitsyn|Simon Litsyn]] ('''1998'''). ''[https://ieeexplore.ieee.org/document/705582 Several new lower bounds on the size of codes with covering radius one]''. [[IEEE#TIT|IEEE Transactions on Information Theory]], Vol. 44, No. 5
* [[Uri Blass]], [[Mathematician#SLitsyn|Simon Litsyn]] ('''1998'''). ''Several new lower bounds for football pool systems''. [https://en.wikipedia.org/wiki/Ars_Combinatoria_(journal) Ars Combinatoria], Vol. 50, [https://pdfs.semanticscholar.org/8ba2/840086bd1f91780087e2b3c81eab9fee9689.pdf pdf]
* [[Uri Blass]], [[Aviezri Fraenkel]], [https://dblp.uni-trier.de/pers/hd/g/Guelman:Romina Romina Guelman] ('''1998'''). ''How Far Can Nim in Disguise be Stretched?'' [https://en.wikipedia.org/wiki/Journal_of_Combinatorial_Theory Journal of Combinatorial Theory], Series A, Vol. 84, [https://arxiv.org/abs/math/9809079 arXiv:math/9809079]
* [[Uri Blass]], [[Mathematician#JHonkala|Iiro Honkala]], [[Mathematician#SLitsyn|Simon Litsyn]] ('''1999'''). ''[https://link.springer.com/chapter/10.1007/3-540-46796-3_14 On the Size of Identifying Codes]''. [https://dblp.uni-trier.de/db/conf/aaecc/aaecc1999.html AAECC 1999], [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Uri Blass]], [[Mathematician#SLitsyn|Simon Litsyn]] ('''1999'''). ''The smallest covering code of length 8 and radius 2 has 12 words''. [https://en.wikipedia.org/wiki/Ars_Combinatoria_(journal) Ars Combinatoria], Vol. 52, [https://pdfs.semanticscholar.org/d94d/c4d1386e9b5fd19c8b352d9c2a991da5efbc.pdf pdf]
==2000 ...==
* [[Uri Blass]], [[Mathematician#JHonkala|Iiro Honkala]], [[Mathematician#SLitsyn|Simon Litsyn]] ('''2000'''). ''[https://onlinelibrary.wiley.com/doi/abs/10.1002/%28SICI%291520-6610%282000%298%3A2%3C151%3A%3AAID-JCD8%3E3.0.CO%3B2-S On binary codes for identification]''. [https://onlinelibrary.wiley.com/toc/15206610/2000/8/2 Journal of Combinatorial Designs, Vol. 8, No. 2]
* [https://users.aalto.fi/~pat/ Patric R. J. Östergård], [[Uri Blass]] ('''2001'''). ''[https://ieeexplore.ieee.org/document/945268 On the size of optimal binary codes of length 9 and covering radius 1]''. [[IEEE#TIT|IEEE Transactions on Information Theory]], Vol. 47, No. 6
* [[Uri Blass]], [[Mathematician#JHonkala|Iiro Honkala]], [https://dblp.uni-trier.de/pers/hd/k/Karpovsky:Mark_G= Mark G. Karpovsky], [[Mathematician#SLitsyn|Simon Litsyn]] ('''2001'''). ''[https://link.springer.com/article/10.1007/PL00001292 Short Dominating Paths and Cycles in the Binary Hypercube]''. [http://www.combinatorics.net/ Annals of Combinatorics], Vol. 5, No. 10
* [[Uri Blass]], [[Mathematician#JHonkala|Iiro Honkala]], [[Mathematician#SLitsyn|Simon Litsyn]] ('''2001'''). ''[https://www.sciencedirect.com/science/article/pii/S0012365X01001133 Bounds on identifying codes]''. [https://en.wikipedia.org/wiki/Discrete_Mathematics_(journal) Discrete Mathematics], Vol. 241, Nos. 1–3
* [[Uri Blass]] ('''2002'''). ''Bounds on Covering Codes''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Tel_Aviv_University Tel Aviv University], advisor [[Mathematician#SLitsyn|Simon Litsyn]]
=Forum Posts=
==1998 ...==
* [https://www.stmintz.com/ccc/index.php?id=16367 some questions about computer chess programs] by [[Uri Blass]], [[CCC]], April 01, 1998
* [https://www.stmintz.com/ccc/index.php?id=16921 how to develop a chess program?] by [[Uri Blass]], [[CCC]], April 14, 1998
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=226258 question about book and learning] by [[Uri Blass]], [[CCC]], April 26, 2002
* [https://www.stmintz.com/ccc/index.php?id=229271 my program movei is released] by [[Uri Blass]], [[CCC]], May 12, 2002
* [https://www.stmintz.com/ccc/index.php?id=235364 Re: Did Uri write movei? (yes)] by [[Uri Blass]], [[CCC]], June 13, 2002
: [https://www.stmintz.com/ccc/index.php?id=235379 Re: Did Uri write movei? (yes)] by [[Dann Corbit]], [[CCC]], June 13, 2002
* [https://www.stmintz.com/ccc/index.php?id=292140 some questions about chess programs and money] by [[Uri Blass]], [[CCC]], April 07, 2003
* [http://www.talkchess.com/forum/viewtopic.php?t=13673 About pawn hash tables] by [[Uri Blass]], [[CCC]], May 10, 2007 » [[Pawn Hash Table]]
* [http://www.talkchess.com/forum/viewtopic.php?t=13800 a beat b,b beat c,c beat a question] by [[Uri Blass]], [[CCC]], May 16, 2007 » [[Engine Testing]], [[Playing Strength]]
* [http://www.talkchess.com/forum/viewtopic.php?t=13969 question about symmertic evaluation] by [[Uri Blass]], [[CCC]], May 23, 2007 » [[Evaluation]]
* [http://www.talkchess.com/forum/viewtopic.php?t=15505 fail high handling with tranposition tables] by [[Uri Blass]], [[CCC]], August 01, 2007 » [[Transposition Table]]
* [http://www.talkchess.com/forum/viewtopic.php?t=16414 discovered check definition] by [[Uri Blass]], [[CCC]], September 12, 2007 » [[Discovered Check]]
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=47161 important ideas in chess programming] by [[Uri Blass]], [[CCC]], February 08, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=51129 fixing the null move search "bug"] by [[Uri Blass]], [[CCC]], February 01, 2014 » [[Null Move Pruning]], [[Stockfish]]
* [http://www.talkchess.com/forum/viewtopic.php?t=58882 Using more than 1 thread in C beginner question] by [[Uri Blass]], [[CCC]], January 11, 2016 » [[C]], [[Thread]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65403 comparing between search or evaluation] by [[Uri Blass]], [[CCC]], October 09, 2017 » [[Evaluation]], [[Search]]
'''2018'''
* [http://www.talkchess.com/forum/viewtopic.php?t=66413 replace the evaluation by playing against yourself] by [[Uri Blass]], [[CCC]], January 25, 2018 » [[Evaluation]], [[Fortress]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66680 Is there a program to build opening books based on engines?] by [[Uri Blass]], [[CCC]], February 23, 2018 » [[Opening Book]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66686 about using winboard] by [[Uri Blass]], [[CCC]], February 25, 2018 » [[WinBoard]]
* [http://www.talkchess.com/forum/viewtopic.php?t=67013 What does LCzero learn?] by [[Uri Blass]], [[CCC]], April 05, 2018 » [[Leela Chess Zero]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=67790 analysis of 1.e4 e5 2.Nf3 f6] by [[Uri Blass]], [[CCC]], June 22, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68100 mate test positions] by [[Uri Blass]], [[CCC]], July 29, 2018 » [[Checkmate]], [[Test-Positions]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68146 A mate suite to test multi-pv and new engines] by [[Uri Blass]], [[CCC]], August 06, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68340 stockfish increasing returns with low nodes] by [[Uri Blass]], [[CCC]], August 31, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68469 evaluation and scaling] by [[Uri Blass]], [[CCC]], September 19, 2018 » [[Fortress]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68657 Test the combinational vision of your engine] by [[Uri Blass]], [[CCC]], October 15, 2018 » [[Combination]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=68760 abstract fairy pieces] by [[Uri Blass]], [[CCC]], October 29, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=68805 rewrite generating a new chess project] by [[Uri Blass]], [[CCC]], November 02, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=69199 Are opening principles correct?] by [[Uri Blass]], [[CCC]], December 09, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=69408 translating chess material and author's right] by [[Uri Blass]], [[CCC]], December 29, 2018
'''2019'''
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=69699 a test position that I composed] by [[Uri Blass]], [[CCC]], January 24, 2019
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=69750 changing the 50 move rule to 5 move rule] by [[Uri Blass]], [[CCC]], January 28, 2019 » [[Fifty-move Rule]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=70115 can stockfish with book beat leela without book?] by [[Uri Blass]], [[CCC]], March 06, 2019 » [[Stockfish]], [[Leela Chess Zero]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=71081 evaluation that usually go up when you are winning] by [[Uri Blass]], [[CCC]], June 24, 2019
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=71127 Are there tools to create opening books] by [[Uri Blass]], [[CCC]], June 28, 2019
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=91 Uri Blass' ICGA Tournaments]
* [http://netanyachess.com/player/5824/en Uri Blass] from [http://netanyachess.com/Index.aspx?Language=en Netanya Chess Club]
* [https://ratings.fide.com/card.phtml?event=2803968 Blass, Uri FIDE Chess Profile]
* [https://www.iccf.com/PlayerDetails.aspx?id=270233 ICCF Player Details - Uri Blass]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Blass]]
[[Category:Chess Player|Blass]]
[[Category:Chess Programmer|Blass]]
