efas · HackerTrans

3 yıl öncediscuss

So many books! Chess becomes all about remembering similar positions - practice and study to understand. In the public domain, Lasker's Manual of Chess is a classic. I saw a study group use that as a textbook. Capablanca's Chess Fundamentals starts at a lower level, but sometimes leaves proofs to the reader - for instance, tells you to be ready to swap one advantage for another - which advantage, again? John Watson cleared the bases with "Secrets of Modern Chess Strategy" and "Chess Strategy in Action", which simply dumbfounded the pundits when they came out. Between them, I prodded him with an email suggesting that understanding nuances in positions, and how small differences could lead to big changes was a key. I haven't bought many chess books lately, but openings books are a dime a dozen and "Basic Chess Endings" is an updated and enduring classic.

efas

3 yıl öncediscuss

Googling "cache:..." said, Google doesn't knows about the repo. Noodling around (duckduckgo that uses Bing) found it - so asking Google how to search github repo with google leads to https://github.com/orgs/community/discussions/42375 Hopefully this helps.

efas

3 yıl öncediscuss

No feedback on that page; it's just an ad. I use a wired headset. Nothing else work for me.

efas

3 yıl öncediscuss

Implicitly, the two signed integers are large enough to fit each other (they are the same size). I would not assume anything about organization in memory though. x=a, y=b; look at arithmetic in pseudo-ops x=a, y=(b-a); there will be an overflow here or after the negation step x=a+(b-a)=b, y=(b-a); x=b, y=(a-b); negate the unitary value could overflow (and set the carry bit) x=b, y=(a-b)+b=a; oops, four operations and not as elegant as XORs can be. Or, the compiler would probably use a third register.

comments