Uri Blass

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 Hamming bounds in coding theory under advisor Simon Litsyn. 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 ...
=Forum Posts=
 * 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

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
 * 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
 * discovered check definition by Uri Blass, CCC, September 12, 2007 » Discovered Check

2010 ...
2018 2019
 * important ideas in chess programming by Uri Blass, CCC, February 08, 2013
 * fixing the null move search "bug" by Uri Blass, CCC, February 01, 2014 » Null Move Pruning, Stockfish
 * 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
 * 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
 * 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