15 years, 10 months ago
Highlights
Can you write (without C# code) how you calculate error for last layer and hidden layers? And how weights are corrected?
15 years, 10 months ago
15 years, 11 months ago
Some time ago I asked why do we rely on result of search to reduced depth. Now it seems so bloody obvious. Both quiescence search and null move heuristic use the assumption…
16 years ago
What is less expensive (executes faster) in C++ (GCC):1. dividing integer by integer (not power of 2)2. if statement with one condition: integer == integer??
16 years, 3 months ago
Hi,I think I'm still a little confused with transposition table.When my search function hits state S before it enters the loop of recursive call, it makes TT look up.When found…
16 years, 3 months ago
Latest Activity
See all in DiscussionsCan you write (without C# code) how you calculate error for last layer and hidden layers? And how weights are …
15 years, 10 months ago
It's hard to understand what are you doing. TT element contains more than just Zobrist hash of game state. It …
15 years, 11 months ago
TSCP is quite good but it cannot be compared to Crafty because Crafty is much more sophisticated. TSCP prints PV …
15 years, 11 months ago