Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Yes, and even a genuinely (with perfect play) losing position can win if it sharp enough and causes your opponent to make a mistake! There's also just the relative strength of one branch vs another - have to prune some if there are too many.

I was just trying to give the flavor of it.



> [E]ven a genuinely (with perfect play) losing position can win if it sharp enough and causes your opponent to make a mistake!

Chess engines typically assume that the opponent plays to the best of their abilities, don't they?


The Contempt Factor is used by engines sometimes.

"The Contempt Factor reflects the estimated superiority/inferiority of the program over its opponent. The Contempt factor is assigned as draw score to avoid (early) draws against apparently weaker opponents, or to prefer draws versus stronger opponents otherwise."

https://www.chessprogramming.org/Contempt_Factor


Hence my weasel wording of 'typically'.


Imagine that there was some non-constructive proof that white would always win in perfect play. Would a well constructed chess engine always resign as black? :P


> Would a well constructed chess engine always resign as black?

Depends on what you mean by well-constructed?




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: