Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Refactoring #112

Merged
merged 1 commit into from Jun 8, 2018
Merged

Refactoring #112

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
13 changes: 7 additions & 6 deletions src/UctSearch.cpp
View file
Open in desktop
Expand Up @@ -159,7 +159,7 @@ static int ExpandNode( game_info_t *game, int color, int current );
static int ExpandRoot( game_info_t *game, int color );

// 思考時間を延長する処理
static bool ExtendTime( void );
static bool ExtendTime( const int moves );

// 候補手の初期化
static void InitializeCandidate( child_node_t *uct_child, int pos, bool ladder );
Expand Down Expand Up @@ -499,10 +499,7 @@ UctSearchGenmove( game_info_t *game, int color )
delete handle[i];
}
mag_count++;
} while (mag_count < 3 &&
game->moves > pure_board_size * 3 - 17 &&
extend_time &&
ExtendTime());
} while (mag_count < 3 && ExtendTime(game->moves));

uct_child = uct_node[current_root].child;

Expand Down Expand Up @@ -989,12 +986,16 @@ InterruptionCheck( void )
// 思考時間延長の確認 //
///////////////////////////
static bool
ExtendTime( void )
ExtendTime( const int moves )
{
int max = 0, second = 0;
const int child_num = uct_node[current_root].child_num;
child_node_t *uct_child = uct_node[current_root].child;

if (moves < pure_board_size * 3 - 17 || !extend_time) {
return false;
}

// 探索回数が最も多い手と次に多い手を求める
for (int i = 0; i < child_num; i++) {
if (uct_child[i].move_count > max) {
Expand Down