Open Mp et Gcc

Bonjour,

j'ai développé un moteur de jeu de dames sous Gcc pour linux. Ayant changer de matériel (Core 2 Quad). Je me suis lancé dans la mise en place de la librairie Open Mp pour amélioré la profondeur de calcul et donc le niveau de jeu du programme.

Après la mise en place d'openMp je constat bien le calcul sur plusieurs processeur, cependant la profondeur et le niveau de jeu est identique.

Je pense que j' effectue le même calcul sur plusieur coeur au lieu de faire une répartition du calcul :?.

Voici le code en question, est-ce que quelqu'un pourrait m'expliquer comment faire et ce que j'ai fais comme erreur ?

Merci par avance pour votre aide ;)

Code:

---

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 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776

/* Search.C */   #include <stdio.h> #include <string.h> #include <stdarg.h> #include <setjmp.h>   #include "search.h" #include "types.h" #include "board.h" #include "clock.h" #include "endgame.h" #include "eval.h" #include "hash.h" #include "mboard.h" #include "mmove.h" #include "move.h" #include "sort.h" #include <omp.h>   /* Constants */   #define EARLY 0.4 /* 0.4 */   #define STRING_SIZE 256   /* Variables */   gint UseHash, UseHistory, UseScout, UseShallow; gint UseExtension, UseMatCut, UseProbCut, UseDataBase; gint ShortDepth, SortDepth;   gint CaptureTotal, CaptureTrue; gint QuietTotal, QuietTrue, QuietFalseOpp;   gint NodeNb, HashNodeNb, EvalNodeNb, EndNodeNb, DbNodeNb, SelNodeNb, CutNodeNb, AllNodeNb; gint MoveGenNb, LegalNb, CutPos, AllPos;   static timer SearchStart; static gint TimerOn; static gdouble ElapsedMax; static jmp_buf Return; static gint NS, ES, HS, RS, DS, Depth;   /* Prototypes */   static gint PVS (mboard *Board, gint Alpha, gint Beta, gint Depth, gint Height, gint *PV); static gint Quiescence (mboard *Board, gint Alpha, gint Beta, gint Height);   static void Output (const gchar *Message, ...); static gchar *InfoString (search *Search); static gchar *PVString (gint *PV);   /* Functions */   /* RootMove() */   void RootMove(const board *Board, gint DepthMax, gdouble TimeMax, search *Search) {   gint I, Event; gint MoveNb, BestValue, Alpha, Beta, Value; gint *NewPV; gdouble Elapsed; mboard NewBoard[1]; mmovelist MoveList[1]; mmove *Move; mundo Undo[1];   SearchStart = CurrentTime(); TimerOn = FALSE;   Search->Move[0] = 0; Search->Move[1] = 0; Search->Move[2] = 0; Search->Depth = 0; Search->Value = 0.0; Search->Time = 0.0;   for (I = 0; I < 64*3+20; I++) Search->PV[I] = 0;   InitSort();   ElapsedMax = TimeMax;   MCopyBoard(Board,NewBoard);   MGenMoves(NewBoard,MoveList); MoveNb = MoveList->MoveNb;   if (MoveNb == 0) { Search->Value = -INF / 100.0; return; } else if (MoveNb == 1) { MCopyMove(MoveList->Move[0].Move,Search->Move); return; }   UpdateHash();   NS = NodeNb; ES = EvalNb; HS = ReadHashTotal; RS = ReadHashTrue; DS = DbEvalNb;   Event = setjmp(Return);   if (Event != 0) {   Output("%s *TIME OUT*\n",InfoString(Search)); Output("\n");   return; }   Depth = ShortDepth;   for (I = 0; I < MoveNb; I++) {   Move = MoveList->Move[I].Move;   MDoMove(NewBoard,Move,Undo); Value = -PVS(NewBoard,-INF,+INF,Depth-1,1,NULL); MUndoMove(NewBoard,Move,Undo);   MoveList->Move[I].Value = Value; }   Elapsed = Duration(SearchStart,CurrentTime());   if (Elapsed <= 0.0) Elapsed = 1.0;   Search->Time = Elapsed;   SortMoveList(MoveList);   Move = MoveList->Move[0].Move;   MCopyMove(Move,Search->Move); Search->Depth = Depth; Search->Value = MoveList->Move[0].Value / 100.0;   NewPV = Search->PV; NewPV = MCopyMove(Move,NewPV); *NewPV = 0;   if (Elapsed >= EARLY * ElapsedMax || MoveList->Move[0].Value >= +INF - (Depth+1) || MoveList->Move[0].Value <= -INF + (Depth+1)) { Output("%s *EARLY*\n",InfoString(Search)); Output("\n"); return; }   TimerOn = TRUE;   for (Depth = ShortDepth+1; Depth <= DepthMax; Depth++) {   BestValue = -INF-1; Alpha = -INF; Beta = +INF;   for (I = 0; I < MoveNb; I++) {   Move = MoveList->Move[I].Move;   Output("%s %2d %2d/%2d %-5.5s",InfoString(Search),Depth,I+1,MoveNb,MMoveString(Move)); MDoMove(NewBoard,Move,Undo); if (I == 0) { NewPV = Search->PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(NewBoard,-Beta,-Alpha,Depth-1,1,NewPV); } else { if (UseScout) { Value = -PVS(NewBoard,-Alpha-1,-Alpha,Depth-1,1,NULL); if (Value > Alpha && Value < Beta) { Output("%s\n",InfoString(Search)); MCopyMove(Move,Search->Move); Search->Depth = Depth; Search->Value = Value / 100.0; Output("%s %2d %2d/%2d %-5.5s",InfoString(Search),Depth,I+1,MoveNb,MMoveString(Move)); NewPV = Search->PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(NewBoard,-Beta,-Value,Depth-1,1,NewPV); } } else { Value = -PVS(NewBoard,-Beta,-Alpha,Depth-1,1,NULL); } }   MUndoMove(NewBoard,Move,Undo);   Elapsed = Duration(SearchStart,CurrentTime()); if (Elapsed <= 0.0) Elapsed = 1.0; Search->Time = Elapsed;   MoveList->Move[I].Value = Value; if (Value > BestValue) { BestValue = Value; if (Value > Alpha) { Alpha = Value; MCopyMove(MoveList->Move[I].Move,Search->Move); Search->Depth = Depth; Search->Value = Value / 100.0; MoveToFront(MoveList,I); if (Value >= Beta) break; } } }   if (Search->Time >= EARLY * ElapsedMax || MoveList->Move[0].Value >= +INF - (Depth+1) || MoveList->Move[0].Value <= -INF + (Depth+1)) { break; } }   Output("%s *EARLY*\n",InfoString(Search)); Output("\n"); }   /* PVS() */   static gint PVS(mboard *Board, gint Alpha, gint Beta, gint Depth1, gint Height, gint *PV) {   gint I, HashMove, MoveNb, NewDepth, Value, BestValue, Min; gint *NewPV; gdouble Elapsed; info *Info; mmovelist MoveList[1]; mmove *Move, *BestMove; mundo Undo[1];   assert(Board!=NULL); assert(Alpha>=-INF&&Alpha<Beta&&Beta<=+INF); assert(Depth1>=0&&Depth1<=DEPTH_MAX);   if (Depth1 == 0) return Quiescence(Board,Alpha,Beta,Height); NodeNb++;   /* Time check */   if (TimerOn && (NodeNb & (8192 - 1)) == 0) { Elapsed = Duration(SearchStart,CurrentTime()); if (Elapsed >= ElapsedMax) longjmp(Return,TRUE); }   /* Hash table retrieval */   Info = NULL;   if (UseHash) { Info = ReadHash(Board->HashKey,Depth); if (Info != NULL) { if (Info->Depth >= Depth) { Value = Info->Value; if (Value < -DB_INF) { Value = -INF + Height; } else if (Value > +DB_INF) { Value = +INF - Height; } if (Info->Min && Value > Alpha) { Alpha = Value; if (Value >= Beta) { HashNodeNb++; return Value; } } if (Info->Max && Value < Beta) { Beta = Value; if (Value <= Alpha) { HashNodeNb++; return Value; } } } } }   /* Move generation */   MGenMoves(Board,MoveList); MoveNb = MoveList->MoveNb;   MoveGenNb++; LegalNb += MoveNb;   /* No move => loss */   if (MoveNb == 0) { Depth1 = DEPTH_MAX; Value = -INF + Height; if (UseHash) { Info = WriteHash(Board->HashKey,Depth1); if (Info != NULL) { Info->Depth = Depth; Info->Min = TRUE; Info->Max = TRUE; Info->Value = Value; } } EndNodeNb++; return Value; }   /* Treat capture & quiet positions */   NewDepth = Depth1;   CaptureTotal++;   if (MoveList->CapturedNb > 0) { /* Capture extension */   CaptureTrue++; if (UseExtension && (Beta != Alpha+1 || MatEval(Board) <= Beta+50)) { NewDepth++; }   } else { /* Quiet position */   /* "Singular" (only 1 legal move) extension */   if (UseExtension && MoveNb == 1) NewDepth++;   /* Endgame database evaluation */   /*if (UseDataBase && Board->PieceNb[WHITE_MAN] + Board->PieceNb[BLACK_MAN] + Board->PieceNb[WHITE_KING] + Board->PieceNb[BLACK_KING] <= PIECE_NB_MAX)*/ if ((UseDataBase=TRUE)) { Value = DbEval(Board); if (Value != -INF-1) { Depth1 = DEPTH_MAX - 1; if (UseHash) { Info = WriteHash(Board->HashKey,Depth1); if (Info != NULL) { Info->Depth = Depth1; Info->Min = TRUE; Info->Max = TRUE; Info->Value = Value; } } DbNodeNb++; return Value; } }   /* Forward cut if ahead in material */   if (UseMatCut && Beta == Alpha+1) { Value = MatEval(Board); if (Value >= Beta+150) { if (PVS(Board,Beta+49,Beta+50,NewDepth/2,Height,NULL) >= Beta+50) { SelNodeNb++; return Beta; } } }   /* ProbCut-like Forward cut */   if (UseProbCut && NewDepth >= 3 && NewDepth <= 6 && Beta == Alpha+1) { Value = Eval(Board,Alpha-50,Beta+50); if (Value <= Alpha-50 && PVS(Board,Alpha-25,Alpha-24,NewDepth/2,Height,NULL) <= Alpha-25) { SelNodeNb++; return Alpha; } else if (Value >= Beta+50 && PVS(Board,Beta+24,Beta+25,NewDepth/2,Height,NULL) >= Beta+25) { SelNodeNb++; return Beta; } }   }   assert(NewDepth>0);   BestValue = -INF-1; BestMove = NULL; Min = FALSE;   if (NewDepth == SortDepth+1) ClearHistory(); /* To make history more dynamic */   /* Try hash killer first */   HashMove = FALSE;   if (UseHash && Info != NULL && Info->Start != 0) { for (I = 0; I < MoveNb; I++) { Move = MoveList->Move[I].Move; if (FROM(Move) == Info->Start && TO(Move) == Info->End) { MoveList->Move[I].Value = HASH_SCORE; MoveToFront(MoveList,I); HashMove = TRUE; break; } } }   if (HashMove) {   I = 0;   Move = MoveList->Move[I].Move;   MDoMove(Board,Move,Undo); NewPV = PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(Board,-Beta,-Alpha,NewDepth-1,Height+1,NewPV); MUndoMove(Board,Move,Undo);   BestValue = Value; BestMove = Move; if (Value > Alpha) { Alpha = Value; Min = TRUE; if (Value >= Beta) { if (UseHash) { Info = WriteHash(Board->HashKey,Depth1); if (Info != NULL) { if (Info->Depth < Depth || Info->Value != Value) { Info->Depth = Depth; Info->Max = FALSE; Info->Value = Value; } Info->Min = TRUE; } } GoodMove(MOVE(Move),Board->Colour,NewDepth,Height); CutNodeNb++; CutPos += I+1; return Value; } } }   /* Move ordering : shallow searches + history */   if (MoveNb > 1) {   if (UseShallow && NewDepth >= SortDepth) {   for (I = 0; I < MoveNb; I++) { Move = MoveList->Move[I].Move; if (UseHash && Info != NULL && FROM(Move) == Info->Start && TO(Move) == Info->End) { MoveList->Move[I].Value = HASH_SCORE; } else { MDoMove(Board,Move,Undo); Value = -PVS(Board,-INF,+INF,NewDepth-4-1,Height+1,NULL); MUndoMove(Board,Move,Undo); MoveList->Move[I].Value = Value; } }   SortMoveList(MoveList);   } else {   for (I = 0; I < MoveNb; I++) { Move = MoveList->Move[I].Move; if (UseHash && Info != NULL && FROM(Move) == Info->Start && TO(Move) == Info->End) { MoveList->Move[I].Value = HASH_SCORE; MoveToFront(MoveList,I); } else if (UseHistory) { MoveList->Move[I].Value = History[MOVE(Move)]; } }   if (UseHistory) SortMoveList(MoveList); } }   /* Move loop */   for (I = 0; I < MoveNb; I++) {   if (HashMove && I == 0) continue; /* Hash move already tried */   Move = MoveList->Move[I].Move;   MDoMove(Board,Move,Undo);   if (I == 0) { NewPV = PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(Board,-Beta,-Alpha,NewDepth-1,Height+1,NewPV); } else { if (UseScout) { Value = -PVS(Board,-Alpha-1,-Alpha,NewDepth-1,Height+1,NULL); if (Value > Alpha && Value < Beta) { NewPV = PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(Board,-Beta,-Value,NewDepth-1,Height+1,NewPV); } } else { Value = -PVS(Board,-Beta,-Alpha,NewDepth-1,Height+1,NULL); } }   MUndoMove(Board,Move,Undo);   if (Value > BestValue) { BestValue = Value; BestMove = Move; if (Value > Alpha) { Alpha = Value; Min = TRUE; if (Value >= Beta) { if (UseHash) { Info = WriteHash(Board->HashKey,Depth); if (Info != NULL) { if (Info->Depth < Depth || Info->Value != Value) { Info->Depth = Depth; Info->Max = FALSE; Info->Value = Value; } Info->Min = TRUE; Info->Start = FROM(Move); Info->End = TO(Move); } } GoodMove(MOVE(Move),Board->Colour,NewDepth,Height); CutNodeNb++; CutPos += I+1; return Value; } } } }   /* No pruning => all-type node */   Value = BestValue; Move = BestMove;   if (UseHash) { Info = WriteHash(Board->HashKey,Depth1); if (Info != NULL) { if (Info->Depth == Depth && Info->Value == Value) { if (Min) Info->Min = TRUE; } else { Info->Depth = Depth; Info->Min = Min; Info->Value = Value; } Info->Max = TRUE; Info->Start = FROM(Move); Info->End = TO(Move); } }   if (Min) GoodMove(MOVE(Move),Board->Colour,NewDepth,Height);   AllNodeNb++; AllPos += MoveNb;   return Value; }   /* Quiescence() */   static gint Quiescence(mboard *Board, gint Alpha, gint Beta, gint Height) {   gint I, NewDepth, MoveNb, Value, BestValue, Min; gdouble Elapsed; mmovelist MoveList[1]; mmove *Move, *BestMove; mundo Undo[1];   assert(Board!=NULL); assert(Alpha>=-INF&&Alpha<Beta&&Beta<=+INF);   NodeNb++;   /* Time check */   if (TimerOn && (NodeNb & (8192 - 1)) == 0) { Elapsed = Duration(SearchStart,CurrentTime()); if (Elapsed >= ElapsedMax) longjmp(Return,TRUE); } /* Capture move generation */   CaptureTotal++; if (! MIsQuiet(Board)) { CaptureTrue++; MGenCaptures(Board,MoveList); MoveNb = MoveList->MoveNb; assert(MoveNb>0); } else { MoveNb = 0; }   /* Evaluation if Quiet */   QuietTotal++; if (MoveNb == 0) { QuietTrue++; Value = Eval(Board,Alpha,Beta); if (Value == -INF) Value += Height; /* Win/loss distance */ EvalNodeNb++; return Value; }   /* Not quiet (there are captures) => 1-ply search */   NewDepth = 1;   BestValue = -INF-1; BestMove = NULL; Min = FALSE;   /* Move ordering : history */   if (UseHistory && MoveNb > 1) {   for (I = 0; I < MoveNb; I++) { Move = MoveList->Move[I].Move; MoveList->Move[I].Value = History[MOVE(Move)]; }   SortMoveList(MoveList); }   /* Move loop */   for (I = 0; I < MoveNb; I++) {   Move = MoveList->Move[I].Move;   MDoMove(Board,Move,Undo);   if (I == 0) { Value = -Quiescence(Board,-Beta,-Alpha,Height+1); } else { if (UseScout) { Value = -Quiescence(Board,-Alpha-1,-Alpha,Height+1); if (Value > Alpha && Value < Beta) { Value = -Quiescence(Board,-Beta,-Value,Height+1); } } else { Value = -Quiescence(Board,-Beta,-Alpha,Height+1); } }   MUndoMove(Board,Move,Undo);   if (Value > BestValue) { BestValue = Value; BestMove = Move; if (Value > Alpha) { Alpha = Value; Min = TRUE; if (Value >= Beta) { GoodMove(MOVE(Move),Board->Colour,NewDepth,Height); CutNodeNb++; CutPos += I+1; return Value; } } } }   Value = BestValue; Move = BestMove;   if (Min) GoodMove(MOVE(Move),Board->Colour,NewDepth,Height);   AllNodeNb++; AllPos += MoveNb;   return Value; } /* Output() */   static void Output(const gchar *Message, ...) {   va_list Args; gchar String[STRING_SIZE]; gint StringSize; static gchar Line[STRING_SIZE]; static gint LineSize;   if (Message == NULL) Message = "";   va_start(Args,Message); vsprintf(String,Message,Args); va_end(Args);   StringSize = strlen(String);   do {LineSize--; printf("\b \b"); } while ( LineSize > 0);   if (StringSize == 0 || String[StringSize-1] != '\n') { strcpy(Line,String); LineSize = StringSize; }   if (StringSize != 0) printf("%s",String); fflush(stdout); }   /* InfoString() */   static gchar *InfoString(search *Search) {   gint N, E, H, R, D; gdouble Speed, Hash, DB; gdouble Elapsed; static gchar String[STRING_SIZE];   Elapsed = Duration(SearchStart,CurrentTime()); if (Elapsed <= 0.0) Elapsed = 1.0;   Search->Time = Elapsed;   N = NodeNb - NS; E = EvalNb - ES; H = ReadHashTotal - HS; R = ReadHashTrue - RS; D = DbEvalNb - DS;   if (N == 0) N = 1; if (E == 0) E = 1; if (H == 0) H = 1;   Speed = N / Search->Time; Hash = 100.0 * R / H; DB = 100.0 * D / E;   if (Hash > 99.9) Hash = 99.9; if (DB > 99.9) DB = 99.9;   sprintf(String,"%2d %+6.2f %-17.17s %5.5s %8d %6.0f %4.1f %4.1f",Search->Depth,Search->Value,PVString(Search->PV),TimeString(Search->Time),N,Speed,Hash,DB);   return String; }   /* PVString() */   static gchar *PVString(gint *PV) {   gint I; static gchar String[3*5+2+1];   strcpy(String,"");   for (I = 0; I < 3; I++) { if (*PV != 0) { if (I > 0) strcat(String," "); strcat(String,MoveString(PV)); do PV++; while (*PV != 0); PV++; } }   return String; }   /* End of Search.C */

---

Bonjour,

Dans ton code, tu n'as ajouté que la librairie omp.h, cela ne suffit pas.

Il faut preciser dans ton programme quelle partie de code est a paralleliser et a donc effectuer sur plusieurs cores. Ca m'etonne que ton prog ait fait les calculs sur deux coeurs la.

Bonsoir désolé,

je me suis trompé de code :oops:

voici le code, il fonctionne mais il n'apporte pas d'amélioration ni sur le plan de la rapidité ni sur le plan de la profondeur de calcul.

:cry:

Merci pour votre aide.

Code:

---

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 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775

/* Search.C */   #include <stdio.h> #include <string.h> #include <stdarg.h> #include <setjmp.h>   #include "search.h" #include "types.h" #include "board.h" #include "clock.h" #include "endgame.h" #include "eval.h" #include "hash.h" #include "mboard.h" #include "mmove.h" #include "move.h" #include "sort.h" #include <omp.h>   /* Constants */   #define EARLY 0.4 /* 0.4 */   #define STRING_SIZE 256   /* Variables */   gint UseHash, UseHistory, UseScout, UseShallow; gint UseExtension, UseMatCut, UseProbCut, UseDataBase; gint ShortDepth, SortDepth;   gint CaptureTotal, CaptureTrue; gint QuietTotal, QuietTrue, QuietFalseOpp;   gint NodeNb, HashNodeNb, EvalNodeNb, EndNodeNb, DbNodeNb, SelNodeNb, CutNodeNb, AllNodeNb; gint MoveGenNb, LegalNb, CutPos, AllPos;   static timer SearchStart; static gint TimerOn; static gdouble ElapsedMax; static jmp_buf Return; static gint NS, ES, HS, RS, DS, Depth;   /* Prototypes */   static gint PVS (mboard *Board, gint Alpha, gint Beta, gint Depth, gint Height, gint *PV); static gint Quiescence (mboard *Board, gint Alpha, gint Beta, gint Height);   static void Output (const gchar *Message, ...); static gchar *InfoString (search *Search); static gchar *PVString (gint *PV);   /* Functions */   /* RootMove() */   void RootMove(const board *Board, gint DepthMax, gdouble TimeMax, search *Search) {   gint I, Event; gint MoveNb, BestValue, Alpha, Beta, Value; gint *NewPV; gdouble Elapsed; mboard NewBoard[1]; mmovelist MoveList[1]; mmove *Move; mundo Undo[1];   SearchStart = CurrentTime(); TimerOn = FALSE;   Search->Move[0] = 0; Search->Move[1] = 0; Search->Move[2] = 0; Search->Depth = 0; Search->Value = 0.0; Search->Time = 0.0;   for (I = 0; I < 64*3+20; I++) Search->PV[I] = 0; InitSort(); ElapsedMax = TimeMax; MCopyBoard(Board,NewBoard); MGenMoves(NewBoard,MoveList); MoveNb = MoveList->MoveNb;   if (MoveNb == 0) { Search->Value = -INF / 100.0; return; } else if (MoveNb == 1) { MCopyMove(MoveList->Move[0].Move,Search->Move); return; }   UpdateHash();   NS = NodeNb; ES = EvalNb; HS = ReadHashTotal; RS = ReadHashTrue; DS = DbEvalNb;   Event = setjmp(Return);   if (Event != 0) {   Output("%s *TIME OUT*\n",InfoString(Search)); Output("\n");   return; }   Depth = ShortDepth; #pragma omp for for (I = 0; I < MoveNb; I++) { Move = MoveList->Move[I].Move; MDoMove(NewBoard,Move,Undo); Value = -PVS(NewBoard,-INF,+INF,Depth-1,1,NULL); MUndoMove(NewBoard,Move,Undo); MoveList->Move[I].Value = Value; }   Elapsed = Duration(SearchStart,CurrentTime());   if (Elapsed <= 0.0) Elapsed = 1.0;   Search->Time = Elapsed;   SortMoveList(MoveList);   Move = MoveList->Move[0].Move;   MCopyMove(Move,Search->Move); Search->Depth = Depth; Search->Value = MoveList->Move[0].Value / 100.0;   NewPV = Search->PV; NewPV = MCopyMove(Move,NewPV); *NewPV = 0;   if (Elapsed >= EARLY * ElapsedMax || MoveList->Move[0].Value >= +INF - (Depth+1) || MoveList->Move[0].Value <= -INF + (Depth+1)) { Output("%s *EARLY*\n",InfoString(Search)); Output("\n"); return; }   TimerOn = TRUE;   for (Depth = ShortDepth+1; Depth <= DepthMax; Depth++) {   BestValue = -INF-1; Alpha = -INF; Beta = +INF;   for (I = 0; I < MoveNb; I++) {   Move = MoveList->Move[I].Move;   Output("%s %2d %2d/%2d %-5.5s",InfoString(Search),Depth,I+1,MoveNb,MMoveString(Move)); MDoMove(NewBoard,Move,Undo); if (I == 0) { NewPV = Search->PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(NewBoard,-Beta,-Alpha,Depth-1,1,NewPV); } else { if (UseScout) { Value = -PVS(NewBoard,-Alpha-1,-Alpha,Depth-1,1,NULL); if (Value > Alpha && Value < Beta) { Output("%s\n",InfoString(Search)); MCopyMove(Move,Search->Move); Search->Depth = Depth; Search->Value = Value / 100.0; Output("%s %2d %2d/%2d %-5.5s",InfoString(Search),Depth,I+1,MoveNb,MMoveString(Move)); NewPV = Search->PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(NewBoard,-Beta,-Value,Depth-1,1,NewPV); } } else { Value = -PVS(NewBoard,-Beta,-Alpha,Depth-1,1,NULL); } }   MUndoMove(NewBoard,Move,Undo);   Elapsed = Duration(SearchStart,CurrentTime()); if (Elapsed <= 0.0)   Elapsed = 1.0; Search->Time = Elapsed;   MoveList->Move[I].Value = Value; if (Value > BestValue) { BestValue = Value; if (Value > Alpha) { Alpha = Value; MCopyMove(MoveList->Move[I].Move,Search->Move); Search->Depth = Depth; Search->Value = Value / 100.0; MoveToFront(MoveList,I); if (Value >= Beta) break; } } }   if (Search->Time >= EARLY * ElapsedMax || MoveList->Move[0].Value >= +INF - (Depth+1) || MoveList->Move[0].Value <= -INF + (Depth+1)) { break; } }   Output("%s *EARLY*\n",InfoString(Search)); Output("\n"); }   /* PVS() */   static gint PVS(mboard *Board, gint Alpha, gint Beta, gint Depth1, gint Height, gint *PV) {   gint I, HashMove, MoveNb, NewDepth, Value, BestValue, Min; gint *NewPV; gdouble Elapsed; info *Info; mmovelist MoveList[1]; mmove *Move, *BestMove; mundo Undo[1];   assert(Board!=NULL); assert(Alpha>=-INF&&Alpha<Beta&&Beta<=+INF); assert(Depth1>=0&&Depth1<=DEPTH_MAX);   if (Depth1 == 0) return Quiescence(Board,Alpha,Beta,Height); NodeNb++;   /* Time check */   if (TimerOn && (NodeNb & (8192 - 1)) == 0) { Elapsed = Duration(SearchStart,CurrentTime()); if (Elapsed >= ElapsedMax) longjmp(Return,TRUE); }   /* Hash table retrieval */   Info = NULL;   if (UseHash) { Info = ReadHash(Board->HashKey,Depth); if (Info != NULL) { if (Info->Depth >= Depth) { Value = Info->Value; if (Value < -DB_INF) { Value = -INF + Height; } else if (Value > +DB_INF) { Value = +INF - Height; } if (Info->Min && Value > Alpha) { Alpha = Value; if (Value >= Beta) { HashNodeNb++; return Value; } } if (Info->Max && Value < Beta) { Beta = Value; if (Value <= Alpha) { HashNodeNb++; return Value; } } } } }   /* Move generation */   MGenMoves(Board,MoveList); MoveNb = MoveList->MoveNb;   MoveGenNb++; LegalNb += MoveNb;   /* No move => loss */   if (MoveNb == 0) { Depth1 = DEPTH_MAX; Value = -INF + Height; if (UseHash) { Info = WriteHash(Board->HashKey,Depth1); if (Info != NULL) { Info->Depth = Depth; Info->Min = TRUE; Info->Max = TRUE; Info->Value = Value; } } EndNodeNb++; return Value; }   /* Treat capture & quiet positions */   NewDepth = Depth1;   CaptureTotal++;   if (MoveList->CapturedNb > 0) { /* Capture extension */   CaptureTrue++; if (UseExtension && (Beta != Alpha+1 || MatEval(Board) <= Beta+50)) { NewDepth++; }   } else { /* Quiet position */   /* "Singular" (only 1 legal move) extension */   if (UseExtension && MoveNb == 1) NewDepth++;   /* Endgame database evaluation */   /*if (UseDataBase && Board->PieceNb[WHITE_MAN] + Board->PieceNb[BLACK_MAN] + Board->PieceNb[WHITE_KING] + Board->PieceNb[BLACK_KING] <= PIECE_NB_MAX)*/ if ((UseDataBase=TRUE)) { Value = DbEval(Board); if (Value != -INF-1) { Depth1 = DEPTH_MAX - 1; if (UseHash) { Info = WriteHash(Board->HashKey,Depth1); if (Info != NULL) { Info->Depth = Depth1; Info->Min = TRUE; Info->Max = TRUE; Info->Value = Value; } } DbNodeNb++; return Value; } }   /* Forward cut if ahead in material */   if (UseMatCut && Beta == Alpha+1) { Value = MatEval(Board); if (Value >= Beta+150) { if (PVS(Board,Beta+49,Beta+50,NewDepth/2,Height,NULL) >= Beta+50) { SelNodeNb++; return Beta; } } }   /* ProbCut-like Forward cut */   if (UseProbCut && NewDepth >= 3 && NewDepth <= 6 && Beta == Alpha+1) { Value = Eval(Board,Alpha-50,Beta+50); if (Value <= Alpha-50 && PVS(Board,Alpha-25,Alpha-24,NewDepth/2,Height,NULL) <= Alpha-25) { SelNodeNb++; return Alpha; } else if (Value >= Beta+50 && PVS(Board,Beta+24,Beta+25,NewDepth/2,Height,NULL) >= Beta+25) { SelNodeNb++; return Beta; } }   }   assert(NewDepth>0);   BestValue = -INF-1; BestMove = NULL; Min = FALSE;   if (NewDepth == SortDepth+1) ClearHistory(); /* To make history more dynamic */   /* Try hash killer first */   HashMove = FALSE;   if (UseHash && Info != NULL && Info->Start != 0) { for (I = 0; I < MoveNb; I++) { Move = MoveList->Move[I].Move; if (FROM(Move) == Info->Start && TO(Move) == Info->End) { MoveList->Move[I].Value = HASH_SCORE; MoveToFront(MoveList,I); HashMove = TRUE; break; } } }   if (HashMove) {   I = 0;   Move = MoveList->Move[I].Move;   MDoMove(Board,Move,Undo); NewPV = PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(Board,-Beta,-Alpha,NewDepth-1,Height+1,NewPV); MUndoMove(Board,Move,Undo);   BestValue = Value; BestMove = Move; if (Value > Alpha) { Alpha = Value; Min = TRUE; if (Value >= Beta) { if (UseHash) { Info = WriteHash(Board->HashKey,Depth1); if (Info != NULL) { if (Info->Depth < Depth || Info->Value != Value) { Info->Depth = Depth; Info->Max = FALSE; Info->Value = Value; } Info->Min = TRUE; } } GoodMove(MOVE(Move),Board->Colour,NewDepth,Height); CutNodeNb++; CutPos += I+1; return Value; } } }   /* Move ordering : shallow searches + history */   if (MoveNb > 1) {   if (UseShallow && NewDepth >= SortDepth) { #pragma omp for for (I = 0; I < MoveNb; I++) { Move = MoveList->Move[I].Move; if (UseHash && Info != NULL && FROM(Move) == Info->Start && TO(Move) == Info->End) { MoveList->Move[I].Value = HASH_SCORE; } else { MDoMove(Board,Move,Undo); Value = -PVS(Board,-INF,+INF,NewDepth-4-1,Height+1,NULL); MUndoMove(Board,Move,Undo); MoveList->Move[I].Value = Value; } }   SortMoveList(MoveList);   } else { #pragma omp for for (I = 0; I < MoveNb; I++) { Move = MoveList->Move[I].Move; if (UseHash && Info != NULL && FROM(Move) == Info->Start && TO(Move) == Info->End) { MoveList->Move[I].Value = HASH_SCORE; MoveToFront(MoveList,I); } else if (UseHistory) { MoveList->Move[I].Value = History[MOVE(Move)]; } }   if (UseHistory) SortMoveList(MoveList); } }   /* Move loop */   for (I = 0; I < MoveNb; I++) {   if (HashMove && I == 0) continue; /* Hash move already tried */   Move = MoveList->Move[I].Move;   MDoMove(Board,Move,Undo);   if (I == 0) { NewPV = PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(Board,-Beta,-Alpha,NewDepth-1,Height+1,NewPV); } else { if (UseScout) { Value = -PVS(Board,-Alpha-1,-Alpha,NewDepth-1,Height+1,NULL); if (Value > Alpha && Value < Beta) { NewPV = PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(Board,-Beta,-Value,NewDepth-1,Height+1,NewPV); } } else { Value = -PVS(Board,-Beta,-Alpha,NewDepth-1,Height+1,NULL); } }   MUndoMove(Board,Move,Undo);   if (Value > BestValue) { BestValue = Value; BestMove = Move; if (Value > Alpha) { Alpha = Value; Min = TRUE; if (Value >= Beta) { if (UseHash) { Info = WriteHash(Board->HashKey,Depth); if (Info != NULL) { if (Info->Depth < Depth || Info->Value != Value) { Info->Depth = Depth; Info->Max = FALSE; Info->Value = Value; } Info->Min = TRUE; Info->Start = FROM(Move); Info->End = TO(Move); } } GoodMove(MOVE(Move),Board->Colour,NewDepth,Height); CutNodeNb++; CutPos += I+1; return Value; } } } }   /* No pruning => all-type node */   Value = BestValue; Move = BestMove;   if (UseHash) { Info = WriteHash(Board->HashKey,Depth1); if (Info != NULL) { if (Info->Depth == Depth && Info->Value == Value) { if (Min) Info->Min = TRUE; } else { Info->Depth = Depth; Info->Min = Min; Info->Value = Value; } Info->Max = TRUE; Info->Start = FROM(Move); Info->End = TO(Move); } }   if (Min) GoodMove(MOVE(Move),Board->Colour,NewDepth,Height);   AllNodeNb++; AllPos += MoveNb;   return Value; }   /* Quiescence() */   static gint Quiescence(mboard *Board, gint Alpha, gint Beta, gint Height) {   gint I, NewDepth, MoveNb, Value, BestValue, Min; gdouble Elapsed; mmovelist MoveList[1]; mmove *Move, *BestMove; mundo Undo[1];   assert(Board!=NULL); assert(Alpha>=-INF&&Alpha<Beta&&Beta<=+INF);   NodeNb++;   /* Time check */   if (TimerOn && (NodeNb & (8192 - 1)) == 0) { Elapsed = Duration(SearchStart,CurrentTime()); if (Elapsed >= ElapsedMax) longjmp(Return,TRUE); } /* Capture move generation */   CaptureTotal++; if (! MIsQuiet(Board)) { CaptureTrue++; MGenCaptures(Board,MoveList); MoveNb = MoveList->MoveNb; assert(MoveNb>0); } else { MoveNb = 0; }   /* Evaluation if Quiet */   QuietTotal++; if (MoveNb == 0) { QuietTrue++; Value = Eval(Board,Alpha,Beta); if (Value == -INF) Value += Height; /* Win/loss distance */ EvalNodeNb++; return Value; }   /* Not quiet (there are captures) => 1-ply search */   NewDepth = 1;   BestValue = -INF-1; BestMove = NULL; Min = FALSE;   /* Move ordering : history */   if (UseHistory && MoveNb > 1) {   #pragma omp for for (I = 0; I < MoveNb; I++) {   Move = MoveList->Move[I].Move;   MoveList->Move[I].Value = History[MOVE(Move)]; }   SortMoveList(MoveList); }   /* Move loop */   for (I = 0; I < MoveNb; I++) {   Move = MoveList->Move[I].Move;   MDoMove(Board,Move,Undo);   if (I == 0) { Value = -Quiescence(Board,-Beta,-Alpha,Height+1); } else { if (UseScout) { Value = -Quiescence(Board,-Alpha-1,-Alpha,Height+1); if (Value > Alpha && Value < Beta) { Value = -Quiescence(Board,-Beta,-Value,Height+1); } } else { Value = -Quiescence(Board,-Beta,-Alpha,Height+1); } }   MUndoMove(Board,Move,Undo);   if (Value > BestValue) { BestValue = Value; BestMove = Move; if (Value > Alpha) { Alpha = Value; Min = TRUE; if (Value >= Beta) { GoodMove(MOVE(Move),Board->Colour,NewDepth,Height); CutNodeNb++; CutPos += I+1; return Value; } } } }   Value = BestValue; Move = BestMove;   if (Min) GoodMove(MOVE(Move),Board->Colour,NewDepth,Height);   AllNodeNb++; AllPos += MoveNb;   return Value; }   /* Output() */   static void Output(const gchar *Message, ...) {   va_list Args; gchar String[STRING_SIZE]; gint StringSize; static gchar Line[STRING_SIZE]; static gint LineSize;   if (Message == NULL) Message = "";   va_start(Args,Message); vsprintf(String,Message,Args); va_end(Args);   StringSize = strlen(String);   do {LineSize--; printf("\b \b"); } while ( LineSize > 0);   if (StringSize == 0 || String[StringSize-1] != '\n') { strcpy(Line,String); LineSize = StringSize; }   if (StringSize != 0) printf("%s",String); fflush(stdout); }   /* InfoString() */   static gchar *InfoString(search *Search) {   gint N, E, H, R, D; gdouble Speed, Hash, DB; gdouble Elapsed; static gchar String[STRING_SIZE];   Elapsed = Duration(SearchStart,CurrentTime()); if (Elapsed <= 0.0) Elapsed = 1.0;   Search->Time = Elapsed;   N = NodeNb - NS; E = EvalNb - ES; H = ReadHashTotal - HS; R = ReadHashTrue - RS; D = DbEvalNb - DS;   if (N == 0) N = 1; if (E == 0) E = 1; if (H == 0) H = 1;   Speed = N / Search->Time; Hash = 100.0 * R / H; DB = 100.0 * D / E;   if (Hash > 99.9) Hash = 99.9; if (DB > 99.9) DB = 99.9;   sprintf(String,"%2d %+6.2f %-17.17s %5.5s %8d %6.0f %4.1f %4.1f",Search->Depth,Search->Value,PVString(Search->PV),TimeString(Search->Time),N,Speed,Hash,DB);   return String; }   /* PVString() */   static gchar *PVString(gint *PV) {   gint I; static gchar String[3*5+2+1];   strcpy(String,""); #pragma omp for for (I = 0; I < 3; I++) { if (*PV != 0) { if (I > 0) strcat(String," "); strcat(String,MoveString(PV)); do PV++; while (*PV != 0); PV++; } }   return String; }   /* End of Search.C */

---

Salut,

Que vaut typiquement, ta variable de tableau "MoveNb", parce que paralleliser une boucle avec openMP implique que la durée d'une itération ou le nombre d'itération soit bien plus grand que la creation et l'attente des threads crées par openMP. Typiquement, si le contenu d'une boucle est peu gourmand, il faut au moins quelques milliers d'itération pour justifier une parallélisation.
A l'aide des fonction "omp_get_wtime()" tu peux mesurer le temps passé dans ta boucle avant et aprés parallélisation pour de rendre compte du gain réel

Je viens d'apporter quelque modifications au code pour prendre en charge omp.

Mais je dois dire que c'est assez complexe à faire.

ce code est fonctionnelle, est-ce que vous avez une idée d'optimisation du code pour omp ?

Code:

---

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 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799

/* Search.C */   #include <stdio.h> #include <string.h> #include <stdarg.h> #include <setjmp.h>   #include "search.h" #include "types.h" #include "board.h" #include "clock.h" #include "endgame.h" #include "eval.h" #include "hash.h" #include "mboard.h" #include "mmove.h" #include "move.h" #include "sort.h" #include <omp.h>   /* Constants */   #define EARLY 0.4 /* 0.4 */   #define STRING_SIZE 256   /* Variables */   gint UseHash, UseHistory, UseScout, UseShallow; gint UseExtension, UseMatCut, UseProbCut, UseDataBase; gint ShortDepth, SortDepth;   gint CaptureTotal, CaptureTrue; gint QuietTotal, QuietTrue, QuietFalseOpp;   gint NodeNb, HashNodeNb, EvalNodeNb, EndNodeNb, DbNodeNb, SelNodeNb, CutNodeNb, AllNodeNb; gint MoveGenNb, LegalNb, CutPos, AllPos;   static timer SearchStart; static gint TimerOn; static gdouble ElapsedMax; static jmp_buf Return; static gint NS, ES, HS, RS, DS, Depth;   /* Prototypes */   static gint PVS (mboard *Board, gint Alpha, gint Beta, gint Depth, gint Height, gint *PV); static gint Quiescence (mboard *Board, gint Alpha, gint Beta, gint Height);   static void Output (const gchar *Message, ...); static gchar *InfoString (search *Search); static gchar *PVString (gint *PV);   /* Functions */   /* RootMove() */   void RootMove(const board *Board, gint DepthMax, gdouble TimeMax, search *Search) {   gint I, Event; gint MoveNb, BestValue, Alpha, Beta, Value; gint *NewPV; gdouble Elapsed; mboard NewBoard[1]; mmovelist MoveList[1]; mmove *Move; mundo Undo[1];   SearchStart = CurrentTime(); TimerOn = FALSE;   Search->Move[0] = 0; Search->Move[1] = 0; Search->Move[2] = 0; Search->Depth = 0; Search->Value = 0.0; Search->Time = 0.0;   for (I = 0; I < 64*3+20; I++) Search->PV[I] = 0; InitSort(); ElapsedMax = TimeMax; MCopyBoard(Board,NewBoard); MGenMoves(NewBoard,MoveList); MoveNb = MoveList->MoveNb;   if (MoveNb == 0) { Search->Value = -INF / 100.0; return; } else if (MoveNb == 1) { MCopyMove(MoveList->Move[0].Move,Search->Move); return; }   UpdateHash();   NS = NodeNb; ES = EvalNb; HS = ReadHashTotal; RS = ReadHashTrue; DS = DbEvalNb;   Event = setjmp(Return);   if (Event != 0) {   Output("%s *TIME OUT*\n",InfoString(Search)); Output("\n");   return; }   Depth = ShortDepth;   #pragma omp for for (I = 0; I < MoveNb; I++) { Move = MoveList->Move[I].Move; MDoMove(NewBoard,Move,Undo); Value = -PVS(NewBoard,-INF,+INF,Depth-1,1,NULL); MUndoMove(NewBoard,Move,Undo); #pragma omp critical MoveList->Move[I].Value = Value; }   Elapsed = Duration(SearchStart,CurrentTime());   if (Elapsed <= 0.0) Elapsed = 1.0;   Search->Time = Elapsed;   SortMoveList(MoveList);   Move = MoveList->Move[0].Move;   MCopyMove(Move,Search->Move); Search->Depth = Depth; Search->Value = MoveList->Move[0].Value / 100.0;   NewPV = Search->PV; NewPV = MCopyMove(Move,NewPV); *NewPV = 0;   if (Elapsed >= EARLY * ElapsedMax || MoveList->Move[0].Value >= +INF - (Depth+1) || MoveList->Move[0].Value <= -INF + (Depth+1)) { Output("%s *EARLY*\n",InfoString(Search)); Output("\n"); return; }   TimerOn = TRUE;   for (Depth = ShortDepth+1; Depth <= DepthMax; Depth++) {   BestValue = -INF-1; Alpha = -INF; Beta = +INF;   for (I = 0; I < MoveNb; I++) {   Move = MoveList->Move[I].Move;   Output("%s %2d %2d/%2d %-5.5s",InfoString(Search),Depth,I+1,MoveNb,MMoveString(Move)); MDoMove(NewBoard,Move,Undo); if (I == 0) { NewPV = Search->PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(NewBoard,-Beta,-Alpha,Depth-1,1,NewPV); } else { if (UseScout) { Value = -PVS(NewBoard,-Alpha-1,-Alpha,Depth-1,1,NULL); if (Value > Alpha && Value < Beta) { Output("%s\n",InfoString(Search)); MCopyMove(Move,Search->Move); Search->Depth = Depth; Search->Value = Value / 100.0; Output("%s %2d %2d/%2d %-5.5s",InfoString(Search),Depth,I+1,MoveNb,MMoveString(Move)); NewPV = Search->PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(NewBoard,-Beta,-Value,Depth-1,1,NewPV); } } else { Value = -PVS(NewBoard,-Beta,-Alpha,Depth-1,1,NULL); } }   MUndoMove(NewBoard,Move,Undo);   Elapsed = Duration(SearchStart,CurrentTime()); if (Elapsed <= 0.0)   Elapsed = 1.0; Search->Time = Elapsed;   MoveList->Move[I].Value = Value; if (Value > BestValue) { BestValue = Value; if (Value > Alpha) { Alpha = Value; MCopyMove(MoveList->Move[I].Move,Search->Move); Search->Depth = Depth; Search->Value = Value / 100.0; MoveToFront(MoveList,I); if (Value >= Beta) break; } } }   if (Search->Time >= EARLY * ElapsedMax || MoveList->Move[0].Value >= +INF - (Depth+1) || MoveList->Move[0].Value <= -INF + (Depth+1)) { break; } }   Output("%s *EARLY*\n",InfoString(Search)); Output("\n"); }   /* PVS() */   static gint PVS(mboard *Board, gint Alpha, gint Beta, gint Depth1, gint Height, gint *PV) {   gint I, HashMove, MoveNb, NewDepth, Value, BestValue, Min; gint *NewPV; gdouble Elapsed; info *Info; mmovelist MoveList[1]; mmove *Move, *BestMove; mundo Undo[1];   assert(Board!=NULL); assert(Alpha>=-INF&&Alpha<Beta&&Beta<=+INF); assert(Depth1>=0&&Depth1<=DEPTH_MAX);   if (Depth1 == 0) return Quiescence(Board,Alpha,Beta,Height); NodeNb++;   /* Time check */   if (TimerOn && (NodeNb & (8192 - 1)) == 0) { Elapsed = Duration(SearchStart,CurrentTime()); if (Elapsed >= ElapsedMax) longjmp(Return,TRUE); }   /* Hash table retrieval */   Info = NULL;   if (UseHash) { Info = ReadHash(Board->HashKey,Depth); if (Info != NULL) { if (Info->Depth >= Depth) { Value = Info->Value; if (Value < -DB_INF) { Value = -INF + Height; } else if (Value > +DB_INF) { Value = +INF - Height; } if (Info->Min && Value > Alpha) { Alpha = Value; if (Value >= Beta) { HashNodeNb++; return Value; } } if (Info->Max && Value < Beta) { Beta = Value; if (Value <= Alpha) { HashNodeNb++; return Value; } } } } }   /* Move generation */   MGenMoves(Board,MoveList); MoveNb = MoveList->MoveNb;   MoveGenNb++; LegalNb += MoveNb;   /* No move => loss */   if (MoveNb == 0) { Depth1 = DEPTH_MAX; Value = -INF + Height; if (UseHash) { Info = WriteHash(Board->HashKey,Depth1); if (Info != NULL) { Info->Depth = Depth; Info->Min = TRUE; Info->Max = TRUE; Info->Value = Value; } } EndNodeNb++; return Value; }   /* Treat capture & quiet positions */   NewDepth = Depth1;   CaptureTotal++;   if (MoveList->CapturedNb > 0) { /* Capture extension */   CaptureTrue++; if (UseExtension && (Beta != Alpha+1 || MatEval(Board) <= Beta+50)) { NewDepth++; }   } else { /* Quiet position */   /* "Singular" (only 1 legal move) extension */   if (UseExtension && MoveNb == 1) NewDepth++;   /* Endgame database evaluation */   /*if (UseDataBase && Board->PieceNb[WHITE_MAN] + Board->PieceNb[BLACK_MAN] + Board->PieceNb[WHITE_KING] + Board->PieceNb[BLACK_KING] <= PIECE_NB_MAX)*/ if ((UseDataBase=TRUE)) { Value = DbEval(Board); if (Value != -INF-1) { Depth1 = DEPTH_MAX - 1; if (UseHash) { Info = WriteHash(Board->HashKey,Depth1); if (Info != NULL) { Info->Depth = Depth1; Info->Min = TRUE; Info->Max = TRUE; Info->Value = Value; } } DbNodeNb++; return Value; } }   /* Forward cut if ahead in material */   if (UseMatCut && Beta == Alpha+1) { Value = MatEval(Board); if (Value >= Beta+150) { if (PVS(Board,Beta+49,Beta+50,NewDepth/2,Height,NULL) >= Beta+50) { SelNodeNb++; return Beta; } } }   /* ProbCut-like Forward cut */   if (UseProbCut && NewDepth >= 3 && NewDepth <= 6 && Beta == Alpha+1) { Value = Eval(Board,Alpha-50,Beta+50); if (Value <= Alpha-50 && PVS(Board,Alpha-25,Alpha-24,NewDepth/2,Height,NULL) <= Alpha-25) { SelNodeNb++; return Alpha; } else if (Value >= Beta+50 && PVS(Board,Beta+24,Beta+25,NewDepth/2,Height,NULL) >= Beta+25) { SelNodeNb++; return Beta; } } /* Shallow searches based singular extension */   /* if (MoveNb > 1 && UseShallow && NewDepth >= 9) {   for (I = 0; I < MoveNb; I++) {   Move = MoveList->Move[I].Move;   MDoMove(Board,Move,Undo);   Value = -PVS(Board,-INF,+INF,NewDepth/2-1,Height+1,NULL);   MUndoMove(Board,Move,Undo);   MoveList->Move[I].Value = Value;   }   SortMoveList(MoveList);   if (MoveList->Move[0].Value >= MoveList->Move[1].Value + 50) {   Move = MoveList->Move[0].Move;   MDoMove(Board,Move,Undo);   Value = -PVS(Board,-Beta,-Alpha,NewDepth+1,Height+1,NULL);   MUndoMove(Board,Move,Undo);   return Value;   }   }*/ }   assert(NewDepth>0);   BestValue = -INF-1; BestMove = NULL; Min = FALSE;   if (NewDepth == SortDepth+1) ClearHistory(); /* To make history more dynamic */   /* Try hash killer first */   HashMove = FALSE;   if (UseHash && Info != NULL && Info->Start != 0) { for (I = 0; I < MoveNb; I++) { Move = MoveList->Move[I].Move; if (FROM(Move) == Info->Start && TO(Move) == Info->End) { MoveList->Move[I].Value = HASH_SCORE; MoveToFront(MoveList,I); HashMove = TRUE; break; } } }   if (HashMove) {   I = 0;   Move = MoveList->Move[I].Move;   MDoMove(Board,Move,Undo); NewPV = PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(Board,-Beta,-Alpha,NewDepth-1,Height+1,NewPV); MUndoMove(Board,Move,Undo);   BestValue = Value; BestMove = Move; if (Value > Alpha) { Alpha = Value; Min = TRUE; if (Value >= Beta) { if (UseHash) { Info = WriteHash(Board->HashKey,Depth1); if (Info != NULL) { if (Info->Depth < Depth || Info->Value != Value) { Info->Depth = Depth; Info->Max = FALSE; Info->Value = Value; } Info->Min = TRUE; } } GoodMove(MOVE(Move),Board->Colour,NewDepth,Height); CutNodeNb++; CutPos += I+1; return Value; } } }   /* Move ordering : shallow searches + history */   if (MoveNb > 1) {   if (UseShallow && NewDepth >= SortDepth) { #pragma omp for for (I = 0; I < MoveNb; I++) { #pragma omp critical Move = MoveList->Move[I].Move; if (UseHash && Info != NULL && FROM(Move) == Info->Start && TO(Move) == Info->End) { MoveList->Move[I].Value = HASH_SCORE; } else { MDoMove(Board,Move,Undo); Value = -PVS(Board,-INF,+INF,NewDepth-4-1,Height+1,NULL); MUndoMove(Board,Move,Undo); #pragma omp critical MoveList->Move[I].Value = Value; } }   SortMoveList(MoveList);   } else { #pragma omp for for (I = 0; I < MoveNb; I++) { #pragma omp critical Move = MoveList->Move[I].Move; if (UseHash && Info != NULL && FROM(Move) == Info->Start && TO(Move) == Info->End) { MoveList->Move[I].Value = HASH_SCORE; MoveToFront(MoveList,I); } else if (UseHistory) { #pragma omp critical MoveList->Move[I].Value = History[MOVE(Move)]; } }   if (UseHistory) SortMoveList(MoveList); } }   /* Move loop */   for (I = 0; I < MoveNb; I++) {   if (HashMove && I == 0) continue; /* Hash move already tried */   Move = MoveList->Move[I].Move;   MDoMove(Board,Move,Undo);   if (I == 0) { NewPV = PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(Board,-Beta,-Alpha,NewDepth-1,Height+1,NewPV); } else { if (UseScout) { Value = -PVS(Board,-Alpha-1,-Alpha,NewDepth-1,Height+1,NULL); if (Value > Alpha && Value < Beta) { NewPV = PV; if (NewPV != NULL) { NewPV = MCopyMove(Move,NewPV); *NewPV = 0; } Value = -PVS(Board,-Beta,-Value,NewDepth-1,Height+1,NewPV); } } else { Value = -PVS(Board,-Beta,-Alpha,NewDepth-1,Height+1,NULL); } }   MUndoMove(Board,Move,Undo);   if (Value > BestValue) { BestValue = Value; BestMove = Move; if (Value > Alpha) { Alpha = Value; Min = TRUE; if (Value >= Beta) { if (UseHash) { Info = WriteHash(Board->HashKey,Depth); if (Info != NULL) { if (Info->Depth < Depth || Info->Value != Value) { Info->Depth = Depth; Info->Max = FALSE; Info->Value = Value; } Info->Min = TRUE; Info->Start = FROM(Move); Info->End = TO(Move); } } GoodMove(MOVE(Move),Board->Colour,NewDepth,Height); CutNodeNb++; CutPos += I+1; return Value; } } } }   /* No pruning => all-type node */   Value = BestValue; Move = BestMove;   if (UseHash) { Info = WriteHash(Board->HashKey,Depth1); if (Info != NULL) { if (Info->Depth == Depth && Info->Value == Value) { if (Min) Info->Min = TRUE; } else { Info->Depth = Depth; Info->Min = Min; Info->Value = Value; } Info->Max = TRUE; Info->Start = FROM(Move); Info->End = TO(Move); } }   if (Min) GoodMove(MOVE(Move),Board->Colour,NewDepth,Height);   AllNodeNb++; AllPos += MoveNb;   return Value; }   /* Quiescence() */   static gint Quiescence(mboard *Board, gint Alpha, gint Beta, gint Height) {   gint I, NewDepth, MoveNb, Value, BestValue, Min; gdouble Elapsed; mmovelist MoveList[1]; mmove *Move, *BestMove; mundo Undo[1];   assert(Board!=NULL); assert(Alpha>=-INF&&Alpha<Beta&&Beta<=+INF);   NodeNb++;   /* Time check */   if (TimerOn && (NodeNb & (8192 - 1)) == 0) { Elapsed = Duration(SearchStart,CurrentTime()); if (Elapsed >= ElapsedMax) longjmp(Return,TRUE); } /* Capture move generation */   CaptureTotal++; if (! MIsQuiet(Board)) { CaptureTrue++; MGenCaptures(Board,MoveList); MoveNb = MoveList->MoveNb; assert(MoveNb>0); } else { MoveNb = 0; }   /* Evaluation if Quiet */   QuietTotal++; if (MoveNb == 0) { QuietTrue++; Value = Eval(Board,Alpha,Beta); if (Value == -INF) Value += Height; /* Win/loss distance */ EvalNodeNb++; return Value; }   /* Not quiet (there are captures) => 1-ply search */   NewDepth = 1;   BestValue = -INF-1; BestMove = NULL; Min = FALSE;   /* Move ordering : history */   if (UseHistory && MoveNb > 1) {   #pragma omp parallel for shared(MoveNb, MoveList) private(I) for (I = 0; I < MoveNb; I++) {   Move = MoveList->Move[I].Move;   MoveList->Move[I].Value = History[MOVE(Move)]; }   SortMoveList(MoveList); }   /* Move loop */   for (I = 0; I < MoveNb; I++) {   #pragma omp critical Move = MoveList->Move[I].Move;   MDoMove(Board,Move,Undo);   if (I == 0) { Value = -Quiescence(Board,-Beta,-Alpha,Height+1); } else { if (UseScout) { Value = -Quiescence(Board,-Alpha-1,-Alpha,Height+1); if (Value > Alpha && Value < Beta) { Value = -Quiescence(Board,-Beta,-Value,Height+1); } } else { Value = -Quiescence(Board,-Beta,-Alpha,Height+1); } }   MUndoMove(Board,Move,Undo);   if (Value > BestValue) { BestValue = Value; BestMove = Move; if (Value > Alpha) { Alpha = Value; Min = TRUE; if (Value >= Beta) { GoodMove(MOVE(Move),Board->Colour,NewDepth,Height); CutNodeNb++; CutPos += I+1; return Value; } } } }   Value = BestValue; Move = BestMove;   if (Min) GoodMove(MOVE(Move),Board->Colour,NewDepth,Height);   AllNodeNb++; AllPos += MoveNb;   return Value; }   /* Output() */   static void Output(const gchar *Message, ...) {   va_list Args; gchar String[STRING_SIZE]; gint StringSize; static gchar Line[STRING_SIZE]; static gint LineSize;   if (Message == NULL) Message = "";   va_start(Args,Message); vsprintf(String,Message,Args); va_end(Args);   StringSize = strlen(String);   do {LineSize--; printf("\b \b"); } while ( LineSize > 0);   if (StringSize == 0 || String[StringSize-1] != '\n') { strcpy(Line,String); LineSize = StringSize; }   if (StringSize != 0) printf("%s",String); fflush(stdout); }   /* InfoString() */   static gchar *InfoString(search *Search) {   gint N, E, H, R, D; gdouble Speed, Hash, DB; gdouble Elapsed; static gchar String[STRING_SIZE];   Elapsed = Duration(SearchStart,CurrentTime()); if (Elapsed <= 0.0) Elapsed = 1.0;   Search->Time = Elapsed;   N = NodeNb - NS; E = EvalNb - ES; H = ReadHashTotal - HS; R = ReadHashTrue - RS; D = DbEvalNb - DS;   if (N == 0) N = 1; if (E == 0) E = 1; if (H == 0) H = 1;   Speed = N / Search->Time; Hash = 100.0 * R / H; DB = 100.0 * D / E;   if (Hash > 99.9) Hash = 99.9; if (DB > 99.9) DB = 99.9;   sprintf(String,"%2d %+6.2f %-17.17s %5.5s %8d %6.0f %4.1f",Search->Depth,Search->Value,PVString(Search->PV),TimeString(Search->Time),N,Speed,Hash);   return String; }   /* PVString() */   static gchar *PVString(gint *PV) {   gint I; static gchar String[3*5+2+1];   strcpy(String,"");   for (I = 0; I < 3; I++) { if (*PV != 0) { if (I > 0) strcat(String," "); strcat(String,MoveString(PV)); do PV++; while (*PV != 0); PV++; } }   return String; }   /* End of Search.C */

---

Je ne connait pas les détails de ton code, mais si je prend la premiere boucle, tes modifs ne me parraissent pas correctes.
Ensuite, il ne faut pas abuser des section critical qui vont rapidement rendre plus lent ta version parralléle comparée à la séquentielle. Donc si je prend ta premiere boucle:

Code:

---

1 2 3 4 5 6 7 8 9 10

#pragma omp for for (I = 0; I < MoveNb; I++) { Move = MoveList->Move[I].Move; MDoMove(NewBoard,Move,Undo); Value = -PVS(NewBoard,-INF,+INF,Depth-1,1,NULL); MUndoMove(NewBoard,Move,Undo); #pragma omp critical MoveList->Move[I].Value = Value; }

---

Je pense plutot que ca devrait etre plutot ca:

Code:

---

1 2 3 4 5 6 7 8 9

#pragma omp parallel for private(I,Move,Value) for (I = 0; I < MoveNb; I++) { Move = MoveList->Move[I].Move; MDoMove(NewBoard,Move,Undo); Value = -PVS(NewBoard,-INF,+INF,Depth-1,1,NULL); MUndoMove(NewBoard,Move,Undo); MoveList->Move[I].Value = Value; }

---

Pour finir je t'avais posé une question à propro de "MoveNb" !
Si tu postes sans lire ce que l'on ecrit ca ne sert à rien de demander de l'aide.

D'autre part, Essaye de faire fonctionner la parallélisation d'un seule boucle avec des tests de speed-up par example de maniére à bien comprendre comment tout ca fonctionne avant d'essayer de paralléliser ton ton code.

Bonjour,
le programme est très complexe à paralléliser, car il tient compte de beaucoup de paramètre.
MoveNb est un entier qui varient selon le temps alloué pour un nombre de coups.
Par exemple je peux lui demander de jouer 50 coups en 1 minute et trente secondes.
ou alors une minute par coup.

Je viens de tester ta modification et cela bloque le programme, en allant dans le moniteur système, je vois que les 4 processeurs sont à 0% d'utilisation.

est-ce que tu veux le code complet pour pouvoir te faire une idée ?

Non, le code complet ne sert à rien. Il faut déjà travailler sur une boucle qu'il faut faire fonctionner correctement puis optimiser. Apres cela toutes tes autres boucles qui ont l'air d'etre sur le même model en découlement


Ce que je t'ai indiqué me semble correct, mais le contenu des fonctions "MDoMove" et "MUndomove" peut avoir de l'importance.

Mais je n'ai toujours pas compris quel etait le nbr d'itération de ta boucle, c'est un élément clef ?
Quel est également la durée totale et d'une seule itération ?

uilise ca:

Code:

---

1 2 3 4 5 6 7

double deb=omp_get_wtime();   // my loop avec et sans omp   printf("durée de la boucle : %lf s\n",omp_get_wtime()-deb); printf("durée d'une itération : %lf s\n",(omp_get_wtime()-deb)/MoveNb);

---

Bonjour,

Est-ce que je peux utiliser xprofiler pour voir les parties qui utilise le plus de temps mémoires et ainsi paralléliser ce code ?

Est-ce une bonne démarche ?

Bonjour et bonne année

Je ne connais pas xprofiler, mais tu semble toujours te diriger vers une approche global de ton probleme alors que je persiste à dire qu'il faut déjà bien métriser les choses localement (même à utiliser un example beaucoup plus simple) avant d'essayer de paralléliser l'ensemble.

Meilleurs voeux pour 2010 ;)

Je regarde le résultat en mettant ton code dans une boucle puis dans une autre ainsi de suite pour voir laquel prend le plus de ressource

Bonjour, je suis toujours sur l'adaptation openmp du code :).

Est-ce que quelq'un connait les algorithmes de programmation des jeux ?

Types PVS, Negascout ou autre, ceci pour avoir un point de vu sur la conception de mon code qui est basé sur l'algorithme PVS avec quelque optimisation.

Je voudrais bien avoir le sentiment sur l'approche à avoir dans la programmation de ce type de jeu. ;)

Bonjour,

Je continue à bosser sur la parallèlisation du code.

C'est plutôt tendu car je débute :D

Et j'ai des variables qui sont liées et qui pose problème