Algorithm-Search
view release on metacpan or search on metacpan
# 1
# ],
# [
# 2,
# 0
# ],
# [
# 3,
# 0
# ],
# [
# 3,
# 1
# ],
# [
# 3,
# 2
# ],
# [
# 2,
# 2
# ],
# [
# 2,
# 3
# ],
# [
# 3,
# 3
# ]
# ], 'harder problem');
$puzzle->set_position(
'1 14 10 4
5 0 6 8
9 11 2 12
13 7 3 15');
# print "pvalue is ".$puzzle->value."\n";
if (!($puzzle->distance_to_final_state)) {
# print "s2 in final\n";
}
else {
# print "s2 not in final\n";
}
# $fifteen_search->search({search_this=>$puzzle,
# max_steps => 40000,
# solutions_to_find=>1,
# search_type => 'bfs',
# do_not_repeat_values => 1,
# });
# is($fifteen_search->{steps}, 25211, 'number of steps');
#
# $fifteen_search->search({search_this=>$puzzle,
# max_steps => 40000,
# solutions_to_find=>1,
# search_type => 'bfs',
# do_not_repeat_values => 1,
# });
# is($fifteen_search->{steps}, 25211, 'number of steps a second time');
$fifteen_search->search({search_this=>$puzzle,
max_steps => 20000,
solutions_to_find=>1,
search_type => 'bfs',
do_not_repeat_values => 1,
});
is($fifteen_search->{steps}, 20000, 'number of steps 2');
$fifteen_search->continue_search({additional_steps => 2000});
is($fifteen_search->{steps}, 22000, 'number of steps 3');
is($fifteen_search->{search_completed},0,'search not completed yet');
$fifteen_search->continue_search({additional_steps => 3210});
is($fifteen_search->{steps}, 25210, 'number of steps 4');
is($fifteen_search->{search_completed},0,'search not completed ');
$fifteen_search->continue_search({additional_steps => 2});
is($fifteen_search->{steps}, 25211, 'number of steps 5');
is($fifteen_search->{search_completed},1,'search completed ');
is_deeply ( $fifteen_search->path,
[
[
1,
2
],
[
2,
2
],
[
2,
1
],
[
1,
1
],
[
0,
1
],
[
0,
2
],
[
1,
2
],
[
1,
1
],
[
0,
( run in 0.905 second using v1.01-cache-2.11-cpan-39bf76dae61 )