Difference between revisions of "Fridel Fainshtein"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Fridel Fainshtein''' FILE:Fainshtein.JPG|border|right|thumb| Fridel Fainshtein <ref>[https://web.archive.org/web/20040712021540/http:/...") |
GerdIsenberg (talk | contribs) |
||
| Line 10: | Line 10: | ||
=Chess Composer= | =Chess Composer= | ||
| + | ==Bitboards== | ||
In his thesis <ref>[[Fridel Fainshtein]] ('''2006'''). ''An Orthodox k-Move Problem-Composer for Chess Directmates''. M.Sc. thesis, [[Bar-Ilan University]], [http://www.problemschach.de/KMOVEComposer.pdf pdf], Appendix D - 64-bit Representation, pp. 105</ref> , | In his thesis <ref>[[Fridel Fainshtein]] ('''2006'''). ''An Orthodox k-Move Problem-Composer for Chess Directmates''. M.Sc. thesis, [[Bar-Ilan University]], [http://www.problemschach.de/KMOVEComposer.pdf pdf], Appendix D - 64-bit Representation, pp. 105</ref> , | ||
and the 2006 [[ICGA Journal#JournalAward|ICGA Journal Award]] winning paper ''A Chess Composer of Two-Move Mate Problems'', co-authored by his thesis supervisor [[Yaakov HaCohen-Kerner]], | and the 2006 [[ICGA Journal#JournalAward|ICGA Journal Award]] winning paper ''A Chess Composer of Two-Move Mate Problems'', co-authored by his thesis supervisor [[Yaakov HaCohen-Kerner]], | ||
| Line 15: | Line 16: | ||
[[Sliding Piece Attacks|Sliding piece attacks]] were generated by a hybrid [[Hiding the Implementation|none rotated approach]] of [[First Rank Attacks#AttacksOnAllRanks|rank lookups]] and the [[Classical Approach|classical approach]] along with some [[Bit-Twiddling|bit-twiddling]] | [[Sliding Piece Attacks|Sliding piece attacks]] were generated by a hybrid [[Hiding the Implementation|none rotated approach]] of [[First Rank Attacks#AttacksOnAllRanks|rank lookups]] and the [[Classical Approach|classical approach]] along with some [[Bit-Twiddling|bit-twiddling]] | ||
<ref>[[Fridel Fainshtein]], [[Yaakov HaCohen-Kerner]] ('''2006'''). ''A Chess Composer of Two-Move Mate Problems''. [[ICGA Journal#29_1|ICGA Journal, Vol. 29, No. 1]], [http://homedir.jct.ac.il/~kerner/pdf_docs/ICGA_computer_composer.pdf pdf], Appendix E: 64-bit representation</ref> . | <ref>[[Fridel Fainshtein]], [[Yaakov HaCohen-Kerner]] ('''2006'''). ''A Chess Composer of Two-Move Mate Problems''. [[ICGA Journal#29_1|ICGA Journal, Vol. 29, No. 1]], [http://homedir.jct.ac.il/~kerner/pdf_docs/ICGA_computer_composer.pdf pdf], Appendix E: 64-bit representation</ref> . | ||
| + | |||
| + | ==Abstract== | ||
| + | Computerized [https://en.wikipedia.org/wiki/Chess_composer chess composers] of [https://en.wikipedia.org/wiki/Twomover#Types_of_problem 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|Iterative-Deepening]] [[Depth-First|Depth-First Search]], and a quality function built with the help of two international masters in [https://en.wikipedia.org/wiki/Chess_problem 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= | =Selected Publications= | ||
Latest revision as of 14:02, 7 April 2021
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
- Fridel Fainshtein (2006). An Orthodox k-Move Problem-Composer for Chess Directmates. M.Sc. thesis, Bar-Ilan University, pdf
- Fridel Fainshtein, Yaakov HaCohen-Kerner (2006). A Chess Composer of Two-Move Mate Problems. ICGA Journal, Vol. 29, No. 1, pdf
- Yaakov HaCohen-Kerner, Fridel Fainshtein (2006). A Deep Improver of Two-move Chess Mate Problems. Cybernetics and Systems, Vol. 37, No. 5
References
- ↑ WCCC 2004 - Pictures - Day 1, img10.jpg with Stefan Meyer-Kahlen and Mina Teicher
- ↑ Fridel Fainshtein (2006). An Orthodox k-Move Problem-Composer for Chess Directmates. M.Sc. thesis, Bar-Ilan University, pdf
- ↑ 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
- ↑ 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
- ↑ dblp: Fridel Fainshtein
