Fridel Fainshtein

From Chessprogramming wiki
Revision as of 14:02, 7 April 2021 by GerdIsenberg (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Home * People * Fridel Fainshtein

Fridel Fainshtein [1]

Fridel Fainshtein,
an Israeli computer scientist with a M.Sc. degree from Bar-Ilan University on computerized chess composers supervised by Yaakov HaCohen-Kerner [2]. During the WCCC 2004 in Ramat Gan, he operated Woodpusher 1997 by John Hamlen at times, who was not only active in chess but also in 9x9 Go.

Chess Composer

Bitboards

In his thesis [3] , and the 2006 ICGA Journal Award winning paper A Chess Composer of Two-Move Mate Problems, co-authored by his thesis supervisor Yaakov HaCohen-Kerner, Fridel Fainshtein describes the model called Chess Composer, which utilizes Bitboard move generation. Sliding piece attacks were generated by a hybrid none rotated approach of rank lookups and the classical approach along with some bit-twiddling [4] .

Abstract

Computerized chess composers of mate problems are rare. Moreover, so far they do not produce either impressive or creative new mate problems. In this paper, we describe a model called CHESS COMPOSER. This model uses a 64-bit representation, an ordered version of Iterative-Deepening Depth-First Search, and a quality function built with the help of two international masters in chess-problem composition. The result is applied on 100 known problems. It shows that the quality of 97 problems has been improved. Some of the improvements are rather impressive considering that most of the tested problems were composed by experienced composers. The new, improved problems can be regarded as creative from the viewpoint of experts in chess compositions, because (1) they seem to be better, and (2) they are not too similar to the original problems. 

Selected Publications

[5]

References

  1. WCCC 2004 - Pictures - Day 1, img10.jpg with Stefan Meyer-Kahlen and Mina Teicher
  2. Fridel Fainshtein (2006). An Orthodox k-Move Problem-Composer for Chess Directmates. M.Sc. thesis, Bar-Ilan University, pdf
  3. Fridel Fainshtein (2006). An Orthodox k-Move Problem-Composer for Chess Directmates. M.Sc. thesis, Bar-Ilan University, pdf, Appendix D - 64-bit Representation, pp. 105
  4. Fridel Fainshtein, Yaakov HaCohen-Kerner (2006). A Chess Composer of Two-Move Mate Problems. ICGA Journal, Vol. 29, No. 1, pdf, Appendix E: 64-bit representation
  5. dblp: Fridel Fainshtein

Up one level