3 ms·
It is, in fact, not easy at all to calculate that. https://en.wikipedia.org/wiki/God%27s_algorithm https://en.wikipedia.org/wiki/God%27s_algorithm (There isn'
by harryh 11y ago
It is, in fact, not easy at all to calculate that.
https://en.wikipedia.org/wiki/God%27s_algorithm https://en.wikipedia.org/wiki/God%27s_algorithm
(There isn't as much info as there should be on that Wikipedia page but it was an open area of research for decades.)
- deleted 11y ago[deleted]
- baddox 11y agoIsn'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.