TalkChess.com

There was some research around 1998 on this (learning evaluation weights) using the program KnightCap and a "TD-Lambda" algorithm.

https://www.google.ca/#q=knightcap+td+lambda

I don't know if that approach would be successful with today's engines.

It looks basically the same as this folding trick by Matt Taylor , although the multiplication constant and BitTable sequence are not quite the same as what is listed on that page. Also, in Stockfish you can find this snippet which I suppose is derived from Tord's original code: // De Bruijn sequenc...

I assume this is the table being asked about? const int BitTable[64] = { 63, 30, 3, 32, 25, 41, 22, 33, 15, 50, 42, 13, 11, 53, 19, 34, 61, 29, 2, 51, 21, 43, 45, 10, 18, 47, 1, 54, 9, 57, 0, 35, 62, 31, 40, 4, 49, 5, 52, 26, 60, 6, 23, 44, 46, 27, 56, 16, 7, 39, 48, 24, 59, 14, 12, 55, 38, 28,...

There is some slightly scary news with using OpenCL, needed by Oscar in OpenCL mode, on some Apple hardware. It seems that some Macs have heat related failure with the lead-free solder used to connect certain discrete graphic processor chips. The solder joints fail after the GPU runs long and hot, ...

If there is only one legal move, the GUI could just make it and not bother the engine. In fact, it wouldn't even have to start the clock. Once the GUI makes a game decision, it is no longer a GUI. That "I" in GUI has a very distinct meaning, it is supposed to simply serve as an interface between th...

Oh, I just thought of another good compiler bug. Two of the compilers we currently use (from the same vendor) have a ridiculous parsing bug in them where sometimes they "forget" about an enum declaration and incorrectly report compile errors everywhere you try to use it. One of the compilers is near...

I agree, but this is now a confirmed high priority defect that exists since late XE 11 and will be fixed in some of the upcoming updates. If you pay $700 for a compiler (I did), you don't expect it to break some trivial multiply with 256; OTOH bugs just happen. At least they could have given me a d...

Quite expensive.... $699 for a single developer "base" license... Yes, considering it's buggy :) Pretty much all optimizing compilers are a little bit buggy, even extremely-well-tested ones. A modern optimizing compiler has a LOT of complex parts that can interact with each other in really subtle w...

What's really nice about SSDs is that their "seek time" is pretty much zero. For some use cases that makes a really huge difference. If you get a quality one, the raw throughput will also be excellent.

The first-repeat-is-a-draw rule seems too draconian, to me. Suppose I advance my queen, and you move something (a knight) to threaten it. I realize my mistake, but I am not allowed to retreat back to my original position without effectively offering you a draw