TrE comments on NonGoogleables - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (21)
For the first one, you may want to google "chess endgame database". First hit (using Ixquick, for me) is an online database where you can quickly confirm that 2 bishops vs. 2 knights is a draw (whereas K+B+B vs. K+N is won for the bishops).
I can't help you about the other two, but I think that searching more general terms might be better if you aren't certain how the professionals talk about the topic in question (e.g. "quantum number conversation").
There:
english.turkcebilgi.com/Bishop+(chess)
I found this:
If it's not Googleable, it's bingable.
Still not good enough.
Well, I was assuming you were talking about the pawnless endgame. For endgames with pawns, I guess there are far too much of them.