25,161
edits
Changes
Created page with "'''Home * People * Yaakov HaCohen-Kerner''' FILE:YaakovHaCohenKerner.jpg|border|right|thumb|195px|link=http://homedir.jct.ac.il/~kerner/| Yaakov HaCohen-..."
'''[[Main Page|Home]] * [[People]] * Yaakov HaCohen-Kerner'''
[[FILE:YaakovHaCohenKerner.jpg|border|right|thumb|195px|link=http://homedir.jct.ac.il/~kerner/| Yaakov HaCohen-Kerner <ref>[http://homedir.jct.ac.il/~kerner/ Home Page of Prof. Yaakov HaCohen-Kerner]</ref> ]]
'''Yaakov HaCohen-Kerner''',<br/>
an Israeli statistician and computer scientist with M.Sc. and Ph.D. degrees from [[Bar-Ilan University]],
and associate professor in CS at the [https://en.wikipedia.org/wiki/Jerusalem_College_of_Technology Jerusalem College of Technology].
His research interests include [https://en.wikipedia.org/wiki/Torah Torah and science], [[Artificial Intelligence|artificial intelligence]], [https://en.wikipedia.org/wiki/Case-based_reasoning case-based processing], [[Games|game playing]] and computer chess with focus on computerized [[Chess Problems, Compositions and Studies|chess composers]].
=Chess Composer=
==Bitboards==
In their paper ''A Chess Composer of Two-Move Mate Problems'', which received the [[ICGA Journal#JournalAward|ICGA Journal Award]], [[Yaakov HaCohen-Kerner]] and [[Fridel Fainshtein]] describe their model called ''Chess Composer'', which utilizes [[Bitboards|Bitboard]] [[Move Generation|move generation]]. [[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>.
==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=
<ref>[https://dblp.org/pid/h/YaakovHaCohenKerner.html dblp: Yaakov HaCohen-Kerner]</ref>
* [[Yaakov HaCohen-Kerner]] ('''1994'''). ''[https://link.springer.com/chapter/10.1007/3-540-60364-6_40 Case-Based Evaluation in Computer Chess]''. [https://dblp.org/db/conf/ewcbr/ewcbr1994.html#Kerner94 EWCBR 1994]
* [[Yaakov HaCohen-Kerner]] ('''1995'''). ''[https://link.springer.com/chapter/10.1007/3-540-60598-3_45 Learning Strategies for Explanation Patterns: Basic Game Patterns with Application to Chess]''. [https://dblp.org/db/conf/iccbr/iccbr1995.html#Kerner95 ICCBR-95]
* [[Yaakov HaCohen-Kerner]], [https://dblp.org/pid/03/6818.html Nahum Cohen], [https://dblp.org/pid/34/4078.html Erez Shasha] ('''1999'''). ''An Improver of Chess Problems''. [http://www.informatik.uni-trier.de/%7Eley/db/journals/cas/cas30.html#HaCohen-KernerCS99 Cybernetics and Systems, Vol. 30, No. 5]
* [[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/%7Ekerner/pdf_docs/ICGA_computer_composer.pdf pdf]
* [[Yaakov HaCohen-Kerner]], [[Fridel Fainshtein]] ('''2006'''). ''A Deep Improver of Two-move Chess Mate Problems''. [https://en.wikipedia.org/wiki/Cybernetics_and_Systems Cybernetics and Systems], Vol. 37, No. 5
=External Links=
* [http://homedir.jct.ac.il/~kerner/ Home Page of Prof. Yaakov HaCohen-Kerner]
* [https://scholar.google.ca/citations?user=3YlIth8AAAAJ&hl=en Yaakov HaCohen-Kerner - Google Scholar]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|HaCohen-Kerner]]
[[FILE:YaakovHaCohenKerner.jpg|border|right|thumb|195px|link=http://homedir.jct.ac.il/~kerner/| Yaakov HaCohen-Kerner <ref>[http://homedir.jct.ac.il/~kerner/ Home Page of Prof. Yaakov HaCohen-Kerner]</ref> ]]
'''Yaakov HaCohen-Kerner''',<br/>
an Israeli statistician and computer scientist with M.Sc. and Ph.D. degrees from [[Bar-Ilan University]],
and associate professor in CS at the [https://en.wikipedia.org/wiki/Jerusalem_College_of_Technology Jerusalem College of Technology].
His research interests include [https://en.wikipedia.org/wiki/Torah Torah and science], [[Artificial Intelligence|artificial intelligence]], [https://en.wikipedia.org/wiki/Case-based_reasoning case-based processing], [[Games|game playing]] and computer chess with focus on computerized [[Chess Problems, Compositions and Studies|chess composers]].
=Chess Composer=
==Bitboards==
In their paper ''A Chess Composer of Two-Move Mate Problems'', which received the [[ICGA Journal#JournalAward|ICGA Journal Award]], [[Yaakov HaCohen-Kerner]] and [[Fridel Fainshtein]] describe their model called ''Chess Composer'', which utilizes [[Bitboards|Bitboard]] [[Move Generation|move generation]]. [[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>.
==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=
<ref>[https://dblp.org/pid/h/YaakovHaCohenKerner.html dblp: Yaakov HaCohen-Kerner]</ref>
* [[Yaakov HaCohen-Kerner]] ('''1994'''). ''[https://link.springer.com/chapter/10.1007/3-540-60364-6_40 Case-Based Evaluation in Computer Chess]''. [https://dblp.org/db/conf/ewcbr/ewcbr1994.html#Kerner94 EWCBR 1994]
* [[Yaakov HaCohen-Kerner]] ('''1995'''). ''[https://link.springer.com/chapter/10.1007/3-540-60598-3_45 Learning Strategies for Explanation Patterns: Basic Game Patterns with Application to Chess]''. [https://dblp.org/db/conf/iccbr/iccbr1995.html#Kerner95 ICCBR-95]
* [[Yaakov HaCohen-Kerner]], [https://dblp.org/pid/03/6818.html Nahum Cohen], [https://dblp.org/pid/34/4078.html Erez Shasha] ('''1999'''). ''An Improver of Chess Problems''. [http://www.informatik.uni-trier.de/%7Eley/db/journals/cas/cas30.html#HaCohen-KernerCS99 Cybernetics and Systems, Vol. 30, No. 5]
* [[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/%7Ekerner/pdf_docs/ICGA_computer_composer.pdf pdf]
* [[Yaakov HaCohen-Kerner]], [[Fridel Fainshtein]] ('''2006'''). ''A Deep Improver of Two-move Chess Mate Problems''. [https://en.wikipedia.org/wiki/Cybernetics_and_Systems Cybernetics and Systems], Vol. 37, No. 5
=External Links=
* [http://homedir.jct.ac.il/~kerner/ Home Page of Prof. Yaakov HaCohen-Kerner]
* [https://scholar.google.ca/citations?user=3YlIth8AAAAJ&hl=en Yaakov HaCohen-Kerner - Google Scholar]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|HaCohen-Kerner]]
