TalkChess.com

You can get a very close approximation to the Stockfish null move pruning with this formula: R = ( ( 13 + depth ) >> 2 ) + MIN(3, (eval - beta) / 185); I was still using the old log formula in RomiChess. This one works better. RomiChessX 55.5/100 against last released RomiChess. Did another 100 gam...

Basic Subroutines and Functions Subroutines are useful little critters, and are used for two basic reasons. One is when you have a given set of instructions which you use at several points in a program. You can write the instructions one time in a subroutine and call that subroutine whenever you wa...

QB64 is a pile of junk, sorry. Simply look at what it transpiles to C for this simple proc: SUB mysub DIM a a = 10 END SUB void SUB_MYSUB(){ qbs *tqbs; ptrszint tmp_long; int32 tmp_fileno; uint32 qbs_tmp_base=qbs_tmp_list_nexti; uint8 *tmp_mem_static_pointer=mem_static_pointer; uint32 tmp_cmem_sp=c...

Only one for Perl (well, two if you count Perl6)? Isn't the Perl motto "There Is More Than One Way To Do It ?" --Jon Forget that, I have just found my dream compiler, QB64, from looking at the list! It is backwards compatible with QBasic 4.5 and yet is a 2019 compiler. It even has 64 bit integers, ...

Also has more than one algorithm for some. Python for example has six.
https://rosettacode.org/wiki/N-queens_problem

Just a note about overclocking. I finally got a 4.4GHz overclock (3.2GHz is stock) stable across all apps and stress test. The nice thing is that it was done with a lower cpu voltage because I finally got the vitt frequency correct. Because of the lower cpu voltage it runs cooler than before. SF run...

When I had first written qperft (I was using a Pentium M at the time), I tried to speed it up by using assembler. To not waste time on non-time-ritical code, I started with the assembler output of the C compiler, and 'hand-optimized' the code of the time-critical loops. It turned out I could delete...

thought I would reply out of interest. On my 2 year old MacBook, 2.2ghz i7 circa 2017 I see this number for perf 6 from start position: White(1): perft 6 total moves=119060324 time=3.11 White(1): Here's the next one: White(1): perft 7 total moves=3195901860 time=82.65 My perft was never optimized f...

Finally, again public! https://github.com/amchess/BrainLearn This is an article explaining our idea: https://github.com/amchess/BrainLearn/blob/master/doc/MASTERING%20THE%20GAME%20OF%20CHESS%20THROUGH%20A%20RE.pdf Have fun! Kelly and Andrea Forgive me, but it seems all you've done is add a "permane...