25,161
edits
Changes
m
no edit summary
'''Brute Force''', <br/>
a chess program by [[Louis Kessler]] that participated in the [[ACM 1977|8th]] and [[ACM 1977|9th]] [[ACM North American Computer Chess Championship|North American Computer Chess Championships]] in 1977 and 1978. Brute Force was a [[Tech]] like program, including such features of an [[Iterative Search|iterative]] [[Alpha-Beta|alpha-beta]] routine, a [[Quiescence Search|quiescence routine]] using [[SOMA#Swapoff|swap-off values]], and an [[Evaluation functionFunction|evaluation function]] based on the opponent's [[Mobility|mobility]] <ref>[[David Levy]] ('''1978'''). ''ACM '78''. [[ICGA Journal#1_1|ICCA Newsletter, Vol. 1, No. 1]]</ref>. At the [[ACM 1977|9th NACCC]], it suffered from an "[[En passant#bugs|en passant bug]]" twice <ref>[https://www.computerwoche.de/a/pech-fuer-den-weltmeister,1191711 Pech für den Weltmeister?], February 02, 1979, [[Computerworld#Woche|Computerwoche]] 5/1979 (German)</ref>, which turned out a wrong implementation due to Kessler's misinterpretation of the rules <ref>Quote by [[Louis Kessler]] from [http://www.lkessler.com/brutefor.shtml A Memorial to BRUTE FORCE]:
As far as the en passant bug goes, it turns out this was my own misinterpretation of the rules. I read that "The en passant capture must be done on the very next turn, or the right to do so is lost”. I had interpreted that as losing the right to do any en passant for the remainder of the game, not just for that one specific en passant. My personal lack of experience in tournament chess led to that, and it cost me.</ref>.
