TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

How to Calculate the Trappiest Openings in Chess Using Stats

81 pointsby datashrimpover 3 years ago

9 comments

Gehinnnover 3 years ago
It would be nice to have a chess trainer AI that considers the human factor when evaluating a position.<p>It&#x27;s funny that it is relatively easy to beat stockfish when the computer has to play without the queen. But it is quite hard to beat a pro player even with such a strong handicap.<p>Still, the pro player has absolutely no chance against the engine without an handicap.<p>Assuming that stockfish runs on a computer that is <i>much</i> faster than what we have today and sees that white can always forcibly win, I wonder if stockfish would immediately resign as black playing against a human, even before the very first move.
评论 #28895080 未加载
评论 #28896921 未加载
评论 #28898042 未加载
dmurrayover 3 years ago
&gt; In order to compare lines of different lengths, we take the geometric mean of the probabilities, to give the average probability of the opponent playing the next required move in sequence.<p>This doesn&#x27;t seem right to me. A line where your opponent has to find ten 75% moves in a row to fall into it is less &quot;probable&quot;, by any reasonable understanding of the word, than one where he has a 50% chance of going wrong immediately.<p>I&#x27;d multiply the probabilities move by move to get the cumulative probability, but I&#x27;d only start at the point where the trap-setter plays a suboptimal move, to account for these different lengths of lines.
评论 #28895633 未加载
_0ffhover 3 years ago
It might also be interesting to calculate the win probabilities for the players when the trap is avoided, so you can judge what you pay for setting the trap.
评论 #28896046 未加载
lixtraover 3 years ago
I miss: A good trap is safe - if the defender responds optimal, the trap setter is not in a worse position than before.
评论 #28895263 未加载
评论 #28895299 未加载
yewenjieover 3 years ago
I would love to see an interactive version of the same that would let me filter with rating ranges and time control.
评论 #28896248 未加载
seanhunterover 3 years ago
I absolutely would have guessed Stafford as the top with Englund near so the resulting ranking seems to correspond strongly with my intuition at least. I&#x27;m surprised Blackmar-Diemer is so high but maybe that becomes more viscious when you&#x27;re higher rated than I am.
评论 #28896065 未加载
dougSF70over 3 years ago
I have tried the Stafford gambit against real people and i have found that unless people fall for the trap it is a very weak play for black. I keep having to make dumb moves hoping for the other player to fall into the trap.
perpetualpatzerover 3 years ago
I imagine the answer here varies a lot by elo of the training corpus because skill effects the probability input. In the 500s, 3. Qh5 to scholar&#x27;s mate is both potent and very probable. In the 1300s it&#x27;s just a mistake. It would be really interesting to see the overlap between high and low elo traps.
评论 #28896043 未加载
edddover 3 years ago
Eric Rosen porn.