Difference between revisions of "Uri Blass"

From Chessprogramming wiki
Jump to: navigation, search
 
(3 intermediate revisions by the same user not shown)
Line 5: Line 5:
 
'''Uri Blass''',<br/>
 
'''Uri Blass''',<br/>
 
an Israeli mathematician, chess and [https://en.wikipedia.org/wiki/Correspondence_chess correspondence chess] player, and computer chess programmer.  
 
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>.
+
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/Covering_code covering codes] under advisor [[Mathematician#SLitsyn|Simon Litsyn]] <ref>[https://www.eng.tau.ac.il/~litsyn/taucv08.pdf Simon Litsyn, Ph.D CV] (pdf)</ref>.
 
Along with [[Aviezri Fraenkel]], he worked on [https://en.wikipedia.org/wiki/Combinatorial_game_theory combinatorial game theory], publishing on [https://en.wikipedia.org/wiki/Wythoff%27s_game Wythoff's game] and the game of [https://en.wikipedia.org/wiki/Nim Nim]. 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>.
 
Along with [[Aviezri Fraenkel]], he worked on [https://en.wikipedia.org/wiki/Combinatorial_game_theory combinatorial game theory], publishing on [https://en.wikipedia.org/wiki/Wythoff%27s_game Wythoff's game] and the game of [https://en.wikipedia.org/wiki/Nim Nim]. 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>.
 
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>.
Line 13: Line 13:
 
<ref>[https://dblp.uni-trier.de/pers/hd/b/Blass:Uri.html dblp: Uri Blass]</ref>  
 
<ref>[https://dblp.uni-trier.de/pers/hd/b/Blass:Uri.html dblp: Uri Blass]</ref>  
 
==1990 ...==
 
==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]], [[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'''). ''[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]], [[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] <ref>[https://en.wikipedia.org/wiki/Football_pools Football pools from Wikipedia]</ref>
 
* [[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]], [[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#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]
Line 141: Line 141:
 
* [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=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
 
* [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
 +
==2020 ...==
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=77544 what is the rating of engines when you do not count draws?] by [[Uri Blass]], [[CCC]], June 23, 2021 » [[Match Statistics]], [[Playing Strength]]
  
 
=External Links=  
 
=External Links=  
Line 154: Line 156:
 
[[Category:Chess Player|Blass]]
 
[[Category:Chess Player|Blass]]
 
[[Category:Chess Programmer|Blass]]
 
[[Category:Chess Programmer|Blass]]
 +
[[Category:Stockfish Contributor|Blass]]

Latest revision as of 22:29, 28 June 2021

Home * People * Uri Blass

Uri Blass,
an Israeli mathematician, chess and correspondence chess player, and computer chess programmer. Uri Blass received his Ph.D. in discrete mathematics at Tel Aviv University in 2002 on the topic of covering codes under advisor Simon Litsyn [2]. Along with Aviezri Fraenkel, he worked on combinatorial game theory, publishing on Wythoff's game and the game of Nim. In 2011, Uri Blass was awarded with the International Correspondence Chess Grand Master title by the ICCF [3]. As active poster in Computer Chess Forums, Uri asked first questions on how to develop a chess program in the late 90s [4], and became an autodidact chess programmer, to release his chess engine Movei in 2002 [5]. More recently, Uri Blass contributed to the Stockfish development [6].

Selected Publications

[7]

1990 ...

2000 ...

Forum Posts

1998 ...

2000 ...

2001

2002

2003

2004

2005 ...

2006

2007

2008

2009

2010 ...

2011

2012

2013

2014

2015 ...

2018

2019

2020 ...

External Links

References

Up one level