skycloudd / eccat

An experimental UCI chess engine written in Rust
MIT License
1 stars 1 forks source link

v0.1.2 reaches higher depth more quickly : pruning ? #2

Open tissatussa opened 2 months ago

tissatussa commented 2 months ago

since you use rather basic HCE eval, did you reach higher depth faster by (better) 'pruning' ? i never fully understood what pruning means when using a recursive search with some "value rules" = nodes are skipped more quickly ?

what do you think ?

[ i know the CPW pages but i'd rather understand the pruning mechanism my own way ]