BBC 1.0 release - UCI chess engine by CMK

[maksimKorzh]

Yes I see but do you think it’s still state of the art to use this rudimentary thing ?

Why not try something different.
And create the strongest B strategy engine. Only relying on branches that are interesting or chosen ?
Why use brute force ?
Brute force is stupid, isn’t it ?

Tuned and optimized alpha beta is not brute force.
It cuts significant amount of nodes to hit greater depth.

re: rudimentary thing
- maybe these links would change your mind)
https://rofchade.nl/?p=307
http://www.computerchess.org.uk/ccrl/40 ... 4-bit_4CPU

Btw could you please point ot type B open source engines?
I'd like to see their search code.

[mclane]

Yes I see but do you think it’s still state of the art to use this rudimentary thing ?

Why not try something different.
And create the strongest B strategy engine. Only relying on branches that are interesting or chosen ?
Why use brute force ?
Brute force is stupid, isn’t it ?

Tuned and optimized alpha beta is not brute force.
It cuts significant amount of nodes to hit greater depth.

re: rudimentary thing
- maybe these links would change your mind)
https://rofchade.nl/?p=307
http://www.computerchess.org.uk/ccrl/40 ... 4-bit_4CPU

Btw could you please point ot type B open source engines?
I'd like to see their search code.

AB is not brute force ??
Of course it is. In the moment no Data is lost it is brute force.
AB has no negative effects, it comes to the same conclusion like A strategy.
I don’t know any B strategy open source.
But I know examples.

E.g. the World computer chess champion David Broughton (UK) who won in 1981 title, his engine is in dedicated chess computers
Sci says chess champion mark V and Mark VI and also in the DOS PC Engine philidor.

Sorry that i don’t have examples in source code.
The idea is to prune those branches away the evaluation calls weak and follow those the evaluation calls interesting.
So it’s pruning more then AB would prune.
Therefore it goes deeper and it makes mistakes, so it plays more human like.

You want to try out ? Google for Philidor by David Broughton and download it and try out the dos program under qemu emulator.

viewtopic.php?t=74164

[maksimKorzh]

Yes I see but do you think it’s still state of the art to use this rudimentary thing ?

Why not try something different.
And create the strongest B strategy engine. Only relying on branches that are interesting or chosen ?
Why use brute force ?
Brute force is stupid, isn’t it ?

Tuned and optimized alpha beta is not brute force.
It cuts significant amount of nodes to hit greater depth.

re: rudimentary thing
- maybe these links would change your mind)
https://rofchade.nl/?p=307
http://www.computerchess.org.uk/ccrl/40 ... 4-bit_4CPU

Btw could you please point ot type B open source engines?
I'd like to see their search code.

AB is not brute force ??
Of course it is. In the moment no Data is lost it is brute force.
AB has no negative effects, it comes to the same conclusion like A strategy.
I don’t know any B strategy open source.
But I know examples.

E.g. the World computer chess champion David Broughton (UK) who won in 1981 title, his engine is in dedicated chess computers
Sci says chess champion mark V and Mark VI and also in the DOS PC Engine philidor.

Sorry that i don’t have examples in source code.
The idea is to prune those branches away the evaluation calls weak and follow those the evaluation calls interesting.
So it’s pruning more then AB would prune.
Therefore it goes deeper and it makes mistakes, so it plays more human like.

You want to try out ? Google for Philidor by David Broughton and download it and try out the dos program under qemu emulator.

viewtopic.php?t=74164

I would at least want to have a look at sources, without that code monkey like me won't code anything decent)