Uri Blass

Home * People * Uri Blass

Uri Blass and Stefan Meyer-Kahlen, WCCC 2004

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 Hamming bounds in coding theory under advisor Simon Litsyn . 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 . As active poster in Computer Chess Forums, Uri asked first questions on how to develop a chess program in the late 90s , and became an autodidact chess programmer, to release his chess engine Movei in 2002 . More recently, Uri Blass contributed to the Stockfish development .

Selected Publications

1990 ...

• Uri Blass, Aviezri Fraenkel (1990). The Sprague-Grundy Function for Wythoff's Game. Theoretical Computer Science, Vol. 75, No 3.
• Uri Blass, Simon Litsyn (1998). Several new lower bounds on the size of codes with covering radius one. IEEE Transactions on Information Theory, Vol. 44, No. 5
• Uri Blass, Simon Litsyn (1998). Several new lower bounds for football pool systems. Ars Combinatoria, Vol. 50, pdf
• Uri Blass, Aviezri Fraenkel, Romina Guelman (1998). How Far Can Nim in Disguise be Stretched? Journal of Combinatorial Theory, Series A, Vol. 84, arXiv:math/9809079
• Uri Blass, Iiro Honkala, Simon Litsyn (1999). On the Size of Identifying Codes. AAECC 1999, Springer
• Uri Blass, Simon Litsyn (1999). The smallest covering code of length 8 and radius 2 has 12 words. Ars Combinatoria, Vol. 52, pdf

2000 ...

• Uri Blass, Iiro Honkala, Simon Litsyn (2000). On binary codes for identification. Journal of Combinatorial Designs, Vol. 8, No. 2
• Patric R. J. Östergård, Uri Blass (2001). On the size of optimal binary codes of length 9 and covering radius 1. IEEE Transactions on Information Theory, Vol. 47, No. 6
• Uri Blass, Iiro Honkala, Mark G. Karpovsky, Simon Litsyn (2001). Short Dominating Paths and Cycles in the Binary Hypercube. Annals of Combinatorics, Vol. 5, No. 10
• Uri Blass, Iiro Honkala, Simon Litsyn (2001). Bounds on identifying codes. Discrete Mathematics, Vol. 241, Nos. 1–3
• Uri Blass (2002). Bounds on Covering Codes. Ph.D. thesis, Tel Aviv University, advisor Simon Litsyn

Forum Posts

1998 ...

• some questions about computer chess programs by Uri Blass, CCC, April 01, 1998
• how to develop a chess program? by Uri Blass, CCC, April 14, 1998

2000 ...

• question about book and learning by Uri Blass, CCC, April 26, 2002
• my program movei is released by Uri Blass, CCC, May 12, 2002
• Re: Did Uri write movei? (yes) by Uri Blass, CCC, June 13, 2002

Re: Did Uri write movei? (yes) by Dann Corbit, CCC, June 13, 2002

• some questions about chess programs and money by Uri Blass, CCC, April 07, 2003
• movei book progress report by Uri Blass, CCC, May 28, 2004

2005 ...

• Movei report in CCT7:first day by Uri Blass, CCC, February 19, 2005 » CCT7
• I need testers for testing movei personalities in test suites by Uri Blass, CCC, November 03, 2005
• Rybka(1 plies)-Movei(3 plies) 10-10 in the nunn match by Uri Blass, CCC, December 06, 2005 » Rybka
• Movei-Gerbil in rhe endgame suite 20.5-9.5 and could be 21.5-8.5 by Uri Blass, CCC, January 01, 2006 » Gerbil

2007

• is there a test suite for avoiding opening traps by Uri Blass, CCC, April 06, 2007
• About pawn hash tables by Uri Blass, CCC, May 10, 2007 » Pawn Hash Table
• a beat b,b beat c,c beat a question by Uri Blass, CCC, May 16, 2007 » Engine Testing, Playing Strength
• question about symmertic evaluation by Uri Blass, CCC, May 23, 2007 » Evaluation
• fail high handling with tranposition tables by Uri Blass, CCC, August 01, 2007 » Transposition Table
• Rybka's knowledge by Uri Blass, CCC, August 23, 2007 » Rybka
• discovered check definition by Uri Blass, CCC, September 12, 2007 » Discovered Check
• About strelka1.8 sources by Uri Blass, CCC, October 01, 2007 » Strelka
• About the code of strelka by Uri Blass, CCC, October 10, 2007
• Fruit2.3.1 stalemate bug by Uri Blass, CCC, October 21, 2007 » Fruit, Stalemate

2008

• Strelka cannot see mate in 1 by Uri Blass, CCC, March 06, 2008 » Strelka
• Fritz10 in correspondence chess question by Uri Blass, CCC, July 24, 2008
• Rybka in the nolot suite by Uri Blass, CCC, August 21, 2008 » Rybka, The Nolot Suite

2009

• stockfish question by Uri Blass, CCC, March 06, 2009
• A question about the best hardware for chess today by Uri Blass, CCC, July 30, 2009
• what is the speed difference between humans and computers by Uri Blass, CCC, November 06, 2009
• morality and legality of dowloading robbolito by Uri Blass, CCC, November 24, 2009 » RobboLito
• 7 piece tablebase question by Uri Blass, CCC, December 16, 2009

2010 ...

• stockfish's unreliable evaluation by Uri Blass, CCC, June 03, 2010
• nolot number 3 again by Uri Blass, CCC, December 18, 2010 » The Nolot Suite
• a hard test position for computers that I composed by Uri Blass, CCC, January 14, 2011
• human computers and the time factor by Uri Blass, CCC, March 18, 2011
• Finding equivalent times for different engines by Uri Blass, CCC, May 19, 2011
• estimating the number of possible stalemates in perft(n) by Uri Blass, CCC, February 18, 2012 » Perft, Stalemate
• important ideas in chess programming by Uri Blass, CCC, February 08, 2013
• Movei, The Baron, and TSCP by Uri Blass, CCC, January 23, 2014 » Movei, The Baron, TSCP
• fixing the null move search "bug" by Uri Blass, CCC, February 01, 2014 » Null Move Pruning, Stockfish

2015 ...

• lazy_smp by Uri Blass, Fishcooking, October 18, 2015 » Stockfish, Lazy SMP
• Using more than 1 thread in C beginner question by Uri Blass, CCC, January 11, 2016 » C, Thread
• comparing between search or evaluation by Uri Blass, CCC, October 09, 2017 » Evaluation, Search

2018

• replace the evaluation by playing against yourself by Uri Blass, CCC, January 25, 2018 » Evaluation, Fortress
• Is there a program to build opening books based on engines? by Uri Blass, CCC, February 23, 2018 » Opening Book
• about using winboard by Uri Blass, CCC, February 25, 2018 » WinBoard
• What does LCzero learn? by Uri Blass, CCC, April 05, 2018 » Leela Chess Zero
• analysis of 1.e4 e5 2.Nf3 f6 by Uri Blass, CCC, June 22, 2018
• mate test positions by Uri Blass, CCC, July 29, 2018 » Checkmate, Test-Positions
• A mate suite to test multi-pv and new engines by Uri Blass, CCC, August 06, 2018
• stockfish increasing returns with low nodes by Uri Blass, CCC, August 31, 2018
• evaluation and scaling by Uri Blass, CCC, September 19, 2018 » Fortress
• Test the combinational vision of your engine by Uri Blass, CCC, October 15, 2018 » Combination
• abstract fairy pieces by Uri Blass, CCC, October 29, 2018
• rewrite generating a new chess project by Uri Blass, CCC, November 02, 2018
• Are opening principles correct? by Uri Blass, CCC, December 09, 2018
• translating chess material and author's right by Uri Blass, CCC, December 29, 2018

2019

• a test position that I composed by Uri Blass, CCC, January 24, 2019
• changing the 50 move rule to 5 move rule by Uri Blass, CCC, January 28, 2019 » Fifty-move Rule
• can stockfish with book beat leela without book? by Uri Blass, CCC, March 06, 2019 » Stockfish, Leela Chess Zero
• evaluation that usually go up when you are winning by Uri Blass, CCC, June 24, 2019
• Are there tools to create opening books by Uri Blass, CCC, June 28, 2019

External Links

• Uri Blass' ICGA Tournaments
• Uri Blass from Netanya Chess Club
• Blass, Uri FIDE Chess Profile
• ICCF Player Details - Uri Blass

References

Up one level