Search found 2973 matches

by lucasart
Thu Dec 16, 2010 6:43 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: debugging TT errors
Replies: 8
Views: 1395

Re: debugging TT errors

Are you sure this is a TT issue? It is very likely that you are incorrectly "timing out" the search. When time runs out, you can _not_ back anything up inside the tree, _anywhere_ because the searches you have are only partially complete at the various points in the tree. This is an easy thing to b...
by lucasart
Tue Dec 14, 2010 8:34 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: debugging TT errors
Replies: 8
Views: 1395

Re: debugging TT errors

1. What does your transaction table entry look like? Do you store the non-hash address part of the hash as a checksum? 2. Do you have a routine to calculate the entire hash from the board? (I assume you use Zobrist hash like everyone else). 1. Here is my hash entry type enum TTScoreType { Scor...
by lucasart
Tue Dec 14, 2010 8:16 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: debugging TT errors
Replies: 8
Views: 1395

debugging TT errors

Hello everyone, and especially those who have actually written an engine and have probably experienced the problems I'm facing now. Sometimes my engine plays a completely stupid move, just giving a piece for no reason. And when I try to understand what happenned, and start from the position, the res...
by lucasart
Tue Dec 14, 2010 8:10 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: displaying the PV
Replies: 19
Views: 2579

Re: displaying the PV

One more tiny thing, your loop terminates by "i < MAX_PLY - 1" but I think you can go one entry further, terminating by "i < MAX_PLY" instead since you do not access your pv[] array with index "i + 1". Here I assume that pv[] is defined with size MAX_PLY. You're right, I was confusing the lines and...
by lucasart
Mon Dec 13, 2010 9:00 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: displaying the PV
Replies: 19
Views: 2579

Re: displaying the PV

struct SearchInfo { move_t best, current, pv[MAX_PLY]; }; SearchInfo si[MAX_PLY]; void UpdatePrincipalVariation(Move best, int ply, SearchTree *ptree) { int i; Move *pvar_ply = ptree->PathNode[ply ].PrincipalVariation; Move *pvar_src = ptree->PathNode[ply+1].PrincipalVariatio...
by lucasart
Mon Dec 13, 2010 8:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: writing a chess engine
Replies: 11
Views: 3687

Re: writing a chess engine

Hello everyone, That's it, my chess engine played its first game without crashing or bugging. And my prey was Pychess 0.10rc1, which is a lame 1500 elo-ish (just guessing ?) program written in Python: [Event "Local Event"] [Site "Local Site"] [Round "1"] [Date "2010.12.13"] [White "Lucas"] [Black "P...
by lucasart
Mon Dec 13, 2010 2:33 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: displaying the PV
Replies: 19
Views: 2579

Re: displaying the PV

In order to use this, you would have to make the pv member of your struct an array: struct SearchInfo { move_t best, current, pv[MAX_PLY]; }; SearchInfo si[MAX_PLY]; Then, whenever you want to update the PV, you copy the best move to si[ply].pv[ply] and copy the content of si[ply+1].pv (s...
by lucasart
Mon Dec 13, 2010 1:41 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: New Search Method(s)
Replies: 137
Views: 30735

Re: New Search Method(s)

if(a != 0 || 1 || 2 ||3 || 4 ||5 || 6 || 7||8||9||10||11||12||13||14||15|| 16||17||18||19||20||21||22||23||24||25||26||27||28||29||30||31||32||33||34||35|| 36||37||38||39||40||41||42||43||44||45||46||47||48||49||50||51||52||53||54||55||56|| 57||58||59){ a = 0; } Your code is wrong...
by lucasart
Mon Dec 13, 2010 1:29 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: displaying the PV
Replies: 19
Views: 2579

Re: displaying the PV

I think your approach does not work because as far as I understand it there is no guarantee that the moves you store are part of the same line. The most common approach is the triangular PV array (see here: http://chessprogramming.wikispaces.com/Principal+variation ). In order to use this, you woul...
by lucasart
Mon Dec 13, 2010 12:27 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Poll for Michael's Tournament
Replies: 7
Views: 1310

Re: Poll for Michael's Tournament

I believe you are in the wrong forum.

this is for people who are interested in technical discussions about chess programming.

there is another section for tournament and match results discussions.