hi there, need some help about the attack bitboards - is it true to say that there is no difference between the attack bitboards of rank and file, and also...
Hi everyone! Hi have a question about hash tables: many engines can resize the table with an input of the user.... how can a program do it (a program written...
Hi all, i am having trouble implementing "thinking output" i use borland c++ 3 to create a win32 console program , and use cin and cout to connect with...
bjordan
bjordan@...
Jul 27, 2004 11:42 am
1726
You just have to do this: cout <<ply <<score <<time <<nodes <<pvAsString <<endl; Mathieu Pagé pagemathieu@... float o=0.075,h=1.5,T,r,O,l,I;int...
no luck using int,int,float,int,char* i am baffled other couts work ... From: "Mathieu Pagé" <pagemathieu@...> To: <chess-engines@yahoogroups.com> ...
bjordan
bjordan@...
Jul 28, 2004 1:49 pm
1728
No luck ? Try again, maybe this time you'll get lucky :) Seriously ... What is the problem ? BTW i'm not sure if the time argument as to be outputted as a...
the below min-program connects with winboard ok and quit and hint work the cout pv etc displays nothing in winboard, whereas other programs can display the pv ...
bjordan
bjordan@...
Jul 29, 2004 4:54 am
1730
cout<<pv<<score<<time<<positions<<text<<endl; This is not correct, you have to put them in the good order : cout <<ply <<score <<time <<nodes <<pvAsString...
Hi everyone! I would like to know how the iterative deep search algotithm should interact with transposition table. E.g.: if the engine start searching (at...
Well lorenzo, that would be perfectly sensable if we did not use Alpha-Beta pruning. However, since we do use it, many brances of the search tree are not...
hi every1 well i am having the same problem as lorenzo's. i call alpha beta with -INFINITY-1 and +INFINITY+1(depth = 1). INFINITY is returned when king is...
Hi everyone, I rewrote my KillerQueen using object oriented programming (c++), but I thought: can OOP be really useful for chess programming? I mean, which...
Hi Lorenzo, Chess engines did need no classes. However there are some data structures that can be used as class in order to make to code more simple and easier...
hi well sorry for my querry i found the bug that was bugging me. (by the way it was not possible to get such a senario, i guess i was too excited to see a ...
Hi all, how deep could extensions, say for checks, go? What is a typical maximum? Bill Jordan "There has to be a better way!" Victorian Chess Pages ...
bjordan
bjordan@...
Aug 20, 2004 3:41 am
1739
i got it working by inserting spaces cout<<pv<<" "<<score etc. ... From: "Mathieu Pagé" <pagemathieu@...> To: <chess-engines@yahoogroups.com> Sent:...
bjordan
bjordan@...
Aug 20, 2004 3:42 am
1740
Hi, yes, classes won't make a engine any faster, but perhaps easier for the programmer i don't have any in my engine Bill Jordan "There has to be a better...
bjordan
bjordan@...
Aug 20, 2004 3:42 am
1741
... but I thought: can OOP be really useful for chess programming? I mean, which data structures can be more efficient (in speed, programming semplicity...
Hello everyone After the moves 1.e4 e5 2.Nf3 d6 3.Nc3 Nc6 4.Bb5 blacks knight on c3 is unable to move to e7 because of the pin by the bishop, but the knight...
Both should be accepted. A fully-qualified move is always acceptable. In SAN, you usually give the minimum info required to disambiguate the move, but you...
Robert M. Hyatt
hyatt@...
Aug 31, 2004 2:36 pm
1744
Could someone tell me what percentage of total CPU time a typical chess engine spends just in the position scoring/evaluation function? If there is no such...
Hi, As a chessplayer, a few months ago I had the 'romantic' vision of programming my own chess engine. I knew nothing about programming, and started learning...
Hi, You can take a look at this chess program. It's a simple program with the objective to show how to program a chess engine. It helped me a lot, and may help...
What you _really_ want is a "negamax search" rather than a minmax search. The difference is that for any depth in the search, you always want the max score....
Robert M. Hyatt
hyatt@...
Aug 31, 2004 5:23 pm
1748
I think what he is talking about is the "horizon" problem. At the last ply of search, when the recapture can't be seen, captures look really good. What you are...
Just a quick message before I leave work... Thank you for the replies. I'll write a negamax function - it's half the code! I also had a look at TSCP. I might...
... acceptable. ... the ... as ... Hello friends, IIRC, checks and pins are not considered in the SAN disambiguation process. Hence, the move should be given...
