Search found 3 matches

by AngularMomentum
Wed Jul 19, 2023 9:52 am
Forum: Programming and Technical Discussions
Topic: How to efficiently calculate mobility.
Replies: 1
Views: 6925

How to efficiently calculate mobility.

To calculate mobility, I need to loop over every enemy piece (the mobility for the moving side is already calculated by the quiscence search) which slows down my NPS from 17mil to 13mil. I can't figure out a good way to incrementally update sliding piece's attack maps. Is there a good way to do that ...
by AngularMomentum
Mon Apr 10, 2023 3:09 am
Forum: Programming and Technical Discussions
Topic: AI performs poorly despite decent depth
Replies: 0
Views: 6937

AI performs poorly despite decent depth

I implemented a chess engine and had it play a game against itself. It searched a maximum of 500 million nodes(takes about a minute) and searched to a depth of 8-10 in the middle game(7 was the lowest) not counting the quiescence search. I didn’t use any pruning that had a chance to change the ...
by AngularMomentum
Mon Apr 10, 2023 2:13 am
Forum: General Topics
Topic: AI performs poorly despite decent depth.
Replies: 1
Views: 1865

AI performs poorly despite decent depth.

I implemented a chess engine and had it play a game against itself. It searched a maximum of 500 million nodes(takes about a minute) and searched to a depth of 8-10 in the middle game(7 was the lowest) not counting the quiescence search. I didn’t use any pruning that had a chance to change the ...