## Search found 248 matches

Mon Oct 10, 2016 4:35 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Truncated Principal Variation
Replies: 21
Views: 1978

### Re: Truncated Principal Variation

Could you also show the code for PVLine? Furthermore, unrelated to your question: in case of a terminal position or timeout you must not call the quiescence search but return immediately. Yeah. I should probably do that. The PVLine is nothing but an array of Move objects. [...] PVLine looks correct...
Mon Oct 10, 2016 3:52 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Truncated Principal Variation
Replies: 21
Views: 1978

### Re: Truncated Principal Variation

Could you also show the code for PVLine? Furthermore, unrelated to your question: in case of a terminal position or timeout you must not call the quiescence search but return immediately. Yeah. I should probably do that. The PVLine is nothing but an array of Move objects. public class PVLine{ ...
Mon Oct 10, 2016 3:11 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Truncated Principal Variation
Replies: 21
Views: 1978

### Truncated Principal Variation

Hey guys, I am using PVS and have found a with Problem with my PVS-Search. I wanted to test PVS (without Transposition tables or any other pruning that could effect the PV) on some testPositions to see wheter i always get the full Principal-Variation. Turns out that this wasnt the case. I would get ...
Sun Oct 09, 2016 10:25 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Problem with Negamax
Replies: 36
Views: 3715

### Re: Problem with Negamax

I solved it. Happy that your solved your problems. Just one thing to add. Move chessboard::findMove() { 45 46 vector<Move> moveList; 47 generateAllMoves(moveList); 48 49 Move bestMove; 50 int maxScore = -INT_MAX; 51 52 for(vector<Move>::iterator it = moveList.begin(); it!= ...
Sun Oct 09, 2016 8:17 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Engine improvement ?
Replies: 25
Views: 3063

### Re: Engine improvement ?

1. Qsearch if depth=0 2. Get TT and look for immediate exit. 3. Null move and look for an immediate exit 4. 2 Killer moves and look for an immediate exit. 5. Generate other moves...and sort to with PV move, TT move, Captures/promotions, history of quiet moves, in that order. 6. Search the move list...
Sat Oct 08, 2016 3:09 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Quiescent Search (and Sorting MoveList)
Replies: 11
Views: 2177

### Re: Quiescent Search (and Sorting MoveList)

I think I have solved my problems with quiescentSearch now. The tips you gave me (and the example code) helped me quite a bit. However, there was something wrong with my evaluation and hence it was very unstable, which I thought was only because quiescent Search wasnt working at all. One problem sol...
Thu Oct 06, 2016 1:07 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Quiescent Search (and Sorting MoveList)
Replies: 11
Views: 2177

### Quiescent Search (and Sorting MoveList)

Hey guys, I have implemented QuiesceneSearch but I it didn't seem to help my engine nor did it hurt my engine in any way. I just wonder if my implementation is correct if that's not the case there is probably a bug somewhere else. (I am using failSort implementation of PVS) Here is the implementatio...
Mon Sep 12, 2016 12:03 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: PVS and transposition tables
Replies: 2
Views: 930

### PVS and transposition tables

Hello Guys, I am trying to implement principal Variation Search with transposition tables. However, I am wondering whether I should store exact values when I am doing a null-window-Search. Seems a little odd to do so. Additionally, I dont know whether my implementation of collecting the PV is correc...