i failed to think out a heuristics algorithm(i hope someone could leave some hints for me)

i combined three different ideas:
*dynamic greedy with random * 10times
*search with pruning (10^7 nodes)
*easy search like others.

i ran slow. i hope you could break my program as soon as possible.