The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.

NAME

Chess::Plisco::Engine::Tree - Plisco's search tee

SYNOPSIS

    my $tree = Chess::Plisco::Engine::Tree->new(Chess::Plisco::Engine::Position->new);

DESCRIPTION

A Chess::Plisco::Engine::Tree holds all information for a current search (for the best move).

PROPERTIES

The tree has the following properties that you can read and manipulate directly.

position

The current position as a Chess::Plisco::Engine::Position object.

start_time

Start time of the current search as an array of seconds and microseconds since the epoch (as returned by "gettimeofday" in Time::HiRes).

allocated_time

The maximum time in ms to think about a move.

nodes_to_tc

When that many nodes have been searched, the time left should be checked again.

stop

A condvar of AniEvent that the engine sends the best mvoe to, when the search is done.

watcher

An instance of a Chess::Plisco::Engine::InputWatcher that is asked about 10 times per second to check the command-line for input.

thinking

Set to true if the engine is thinking.

bestmove

The best move as a string.

score

The current score of the position.

COPYRIGHT

Copyright (C) 2021 Guido Flohr <guido.flohr@cantanea.com>, all rights reserved.

SEE ALSO

Chess::Plisco::Engine::Position, perl(1)