Incredibly cool VP features
Posted: 22 Jul 2020 2:28
I would like to mention just a few of the VP features that greatly aid/help me writing my chess program NADYA2.0 chess. I was thinking I wanted to give some complements to the PDC team for your efforts:
1. The VP compiler has absolutely no memory loss issues (at least in my application). I run regular tests that calculate billions of chess moves and have never seen a memory leak. This includes tests that take multiple days to complete.
2. Delayed calculated constants calculated by predicates--not called unless you actually need to calculate a value.
3. One of my favorite VP compiler features since I discovered it: "presenters"!!! Debugging a chess program can be very tedious. Having the ability to look at board positions / moves / pieces / captures, etc... while debugging in the VP debugger, in their contextual representations instead of just numerical values / pointers, etc is probably one of the coolest compiler features ever!
Cheers,
CHoibakk
1. The VP compiler has absolutely no memory loss issues (at least in my application). I run regular tests that calculate billions of chess moves and have never seen a memory leak. This includes tests that take multiple days to complete.
2. Delayed calculated constants calculated by predicates--not called unless you actually need to calculate a value.
Code: Select all
facts
pos_bits_w : c_bb := get_pos_bits_w_() [constant]. % If I don't try to access pow_bits_w, it won't be calculated
pos_bits_b : c_bb := get_pos_bits_b_() [constant]. % and once calculated, it can't be changed!
Cheers,
CHoibakk