if consider the position of player there are about 7.5*10^8(upper_bound),state, we can come up some idea
to compact the states,and use a huge array instead of hash_table to prevent the duplication of states this may far speed up your program

Edited by author 15.11.2016 13:02

Edited by author 15.11.2016 13:02

maybe for every 3*10^7 possible states,we can compact the postion of player and record the number of connected place,and use twice bfs search I think that will reduce the number of states we must store...