3 ms·
Isn't it though? I thought the hard part was proving the minimum number of moves that can solve all possible initial states. Korf's algorithm and several subseq
by baddox 11y ago
Isn't it though? I thought the hard part was proving the minimum number of moves that can solve all possible initial states. Korf's algorithm and several subsequent improvements seem to be able to find the minimum number of moves to solve any given initial state.
- harryh 11y agoA yes. You are correct. Finding minimum # of moves from a single state = not so hard. Finding the worst possible state (the state where the minimum # of moves is a maximum) = pretty hard, though now solved.