TalkChess.com

Cool, thanks.
The pascal version is just what i need.

Laurie.

I know it may not be a popular opinion but I think they should have had
Pascal 1
Pascal 2
Pascal 3
Pascal 4
etc etc.

But each to their own.............

I have found that in one game, my program locked up when it reaches depth = 11 in the iterative search. If I change the first block of code to the second block it then works ??? But the code gives the same logic/conditions ??? (I'm using Free Pascal). Have I missed something ? (the indenting has bee...

Yes, you guessed it, I found a bug.
Or should I say a dumb logic mistake.

I'm listening

Yep, it does return zero.....and I couldn't agree more with your reasoning ??
When I set up the position again and try to reproduce it.....guess what !! I can't yet. So there must be
a bug somewhere. Ahh well, gives me something to think about while the golf course is closed.

I do, and the program avoids it for a while but eventually fails.....
Maybe I should check the 3 fold code.
Hmm ?

It's the end game. White is 3 pawns ahead, but black keeps threatening to take 1 of 2 pawns.. white shuffles it's king back and forth to save both pawns resulting in 3 fold rep. If white gave up one pawn he could win the game, but it's beyond the horizon.
Any way to remedy this ???

Null move causes a beta cut.
Can I save anything to the TT ?
What move could you save ?

Hey all.

My program does not have a seperate root search and I have noticed that the root node is an 'All node'.
Is this always going to be the case ?
Can I change/improve this ?

Laurie (LTchess)