必要ないノードの削除処理。赤文字。
１７深度で試した。速度は早いがやはりメモリー不足になる。深度を浅くするしかない。
if(n->child_top == 0){
//------------------------------------------
//自分も相手も打てない場合、上に上がる
// list_child_view(n, 1);
// NODE *pa = NULL;
// pa = (NODE*)n->prev;
//---------------------------
//最終局面
n->endf = 1;
jude(n);
//--------------------
//局面記録 ★
list_view(n, WHO);
//-----------------------------------
// ここにきたら、この親の子を全て削除しポインターをつなげる
/*
#6,800013,683140,_1110___111__00110__010___1@1______1,-,way, 1090505020402
>6,800024,683141,_1111*__111__00110__011___0_1___0__1,winB,way,109050502040301
>6,800025,683142,_1110__*111__01110__011___0_1___0__1,winB,way,109050502040302
>6,800026,683143,_1110___111_*11110__011___0_1___0__1,winB,way,109050502040303
>6,800027,683144,_1110___111__10110*_011___0_1___0__1,winB,way,109050502040304
>6,800028,683145,_1110___111__01110_*111___0_1___0__1,winB,way,109050502040305
>6,800029,683146,_1110___111__00110__111__*0_1___0__1,winB,way,109050502040306
>6,800030,683147,_1110___111__00110__011___1_1__*0__1,winB,way,109050502040307
#6,800023,683147,_1110___111__00110__011___0_1___@__1,-,way, 1090505020403
>6,800032,683148,_1111*__111__00100__110___1_0_____01,winB,way,109050502040401
>6,800033,683149,_1110_*_110__10100__110___1_0_____01,winB,way,109050502040402
>6,800034,683150,_1110__*110__01100__110___1_0_____01,winB,way,109050502040403
>6,800035,683151,_1110___111*_00110__110___1_0_____01,winB,way,109050502040404
>6,800036,683152,_1110___110_*11100__110___1_0_____01,winB,way,109050502040405
>6,800037,683153,_1110___110__10100*_110___1_0_____01,winB,way,109050502040406
>6,800038,683154,_1110___110__01100_*110___1_0_____01,winB,way,109050502040407
>6,800039,683155,_1110___110__00110__111*__1_0_____01,winB,way,109050502040408
>6,800040,683156,_1110___110__00100__111___1_0*____01,winB,way,109050502040409
>6,800041,683157,_1110___110__00100__110___1_0____*11,winB,way,109050502040410
#6,800031,683157,_1110___110__00100__110___1_0_____@1,-,way, 1090505020404
#6,800006,683157,_1110___11*__00110__111___1_1______1,-,way, 10905050204
*/
int n1_len = strlen(n->node);
int n2_len = 0;
for(p = node_bottom; p !=NULL; ){
q = p;
p = (NODE*)p->next;
if(strcmp(q->node, n->node) == 0){
if(q == node_top)break;
free(q);
}else{
q == node_bottom;
}
}
//自分自身も掃除
free(n);
//-----------------------------------
return;
PR
リンク
