Search found 178 matches

by Harald
Sat Jun 01, 2013 9:50 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Possible history table improvement
Replies: 14
Views: 4622

Re: Possible history table improvement

And when I wrote that I thought that & had a higher priority than <.
That was also wrong. We learn: Just use a lot of () and be careful with & in conditions.
by Harald
Fri May 31, 2013 7:42 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Possible history table improvement
Replies: 14
Views: 4622

Re: Possible history table improvement

if(ply < MAXHISTORYPLY & value >= beta) { historytable[piece][to] += (MAXHISTORYPLY - ply)*(MAXHISTORYPLY - ply); } Changing the history table only when beta is less than 1 (or 2) is strange. :-) In C and C++ you better use &&. Your compiler may also tell you that....
by Harald
Sun May 12, 2013 8:02 pm
Forum: Computer Chess Club: General Topics
Topic: TalkChess : Logo for fun
Replies: 6
Views: 1192

Re: TalkChess : Logo for fun

I like the colors but I do not like the logos. Sorry. Both do not invoke any association of chess or talk in me. Disclaimer: I am not a designer or layouter or any graphic professional. 1) Why are the 4 squares not the same size and why are they not aligned? The uppercase letters of TALK and the low...
by Harald
Tue May 07, 2013 9:34 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Root move order (again)
Replies: 33
Views: 6649

Re: Root move order (again)

What you want to see is that if a move is easy, such as the only obvious reply to a capture, the others should be cut of quickly and thus most of the time spent on this easy move. You are looking for this to reflect the move that is best. If the move is hard and many other moves are just as good or...
by Harald
Wed Mar 20, 2013 12:26 am
Forum: Computer Chess Club: General Topics
Topic: 5th WCCC 1986, video on youtube
Replies: 7
Views: 1621

Re: 5th WCCC 1986, video on youtube

29 minutes long : http://www.youtube.com/watch?v=4ttcO4UU9RU In German. It would be cool if someone would translate in English :-) Please forgive me my bad English and quick typing. Here it is: WCCC Cologne (1986) 0 Titel: Chess programs want to be world champion background Vlastimil Hort: There wh...
by Harald
Thu Dec 27, 2012 11:17 pm
Forum: Computer Chess Club: General Topics
Topic: How to Lose to chess computers and/or engines
Replies: 17
Views: 2353

Re: How to Lose to chess computers and/or engines

I tried to beat the computer at chess
but soon the position looked like a mess.
Switching sides white and black
was just an illegal hack.
In the end it was futile I guess.

Harald
by Harald
Thu Dec 27, 2012 4:12 pm
Forum: Computer Chess Club: General Topics
Topic: How to Lose to chess computers and/or engines
Replies: 17
Views: 2353

Re: How to Lose to chess computers and/or engines

When I played chess against a computer I did my very best
until my position was lost beyond all hope.
Then I switched the sides and tried to win with the computer position
until I had to switch sides again.
The challenge was to win with less than three side switches. :oops:

Harald
by Harald
Thu Dec 27, 2012 3:48 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Adjustable search pruning depending on time control
Replies: 34
Views: 6511

Re: Adjustable search pruning depending on time control

It is not unreasonable to assume that null move and lmr would be dependent since they are both methods to get a quick fail low on a move (as is futility). Yes, it is just a question of degree. Since one is based on the score and the other on the movecount, I didn't think they would be all that clos...
by Harald
Sun Dec 16, 2012 11:43 pm
Forum: Computer Chess Club: General Topics
Topic: Shall we update Talkchess' software?
Replies: 146
Views: 21611

Re: Shall we update Talkchess' software?

Maybe I'm wrong, but IIRC the thread view wasn't part of the original PHPBB either: it was a special plugin hand-made by some users. I think Chris Conkie was involved in this, so maybe he would tell us more. :) What I meant is that what have been done once could certainly be done again. If there ar...
by Harald
Fri Oct 19, 2012 11:42 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Looking for an CPU Instruction or a Function Which Can ...
Replies: 25
Views: 4406

Re: Looking for an CPU Instruction or a Function Which Can .

Hi If you already know k1 and k2 you could use Martin's formula (slightly changed): ((1 << (k1+1))-1) ^ ((1<<(k2))-1) If your bits k1, k and k2 are on one rank of a chess board and you know the rank (0..7) then you can shift it down first, (N >> rank) and look up the result in a table indexed by the...