use BFS Algorithm for eight in digital 3* 3, the box copy digital 1-8, 0 for a change in spacing rules for space and can, under the right, left four adjacent digital exchange, and to target state of the same, each state with a node and each said nodes changes each have up to four nodes, and these nodes will be followed into the queue, for example, the initial node S0, out into the queue after the teams will have the most S0 changes of the four nodes S01, S02, SO3, S04-followed cohort, when S01 out teams after the four nodes S11 , S12, S13, S14 (not, in fact, four nodes), followed by the team, each team up with the end node comparison, if the same were to withdraw from, in order to prevent the team has the guitar again joined the team, (this will lead out cycle), each of the team set up a

Eight
.....\Eight.cpp
.....\Eight.dsp
.....\Eight.dsw
.....\Eight.ncb
.....\Eight.opt
.....\Eight.plg
.....\ReadMe.txt
.....\StdAfx.cpp
.....\StdAfx.h
.....\算法说明.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．