Given a minimum h*, the solution of the 15-digit problem increases the value of h* recursively, one at a time, until the optimal solution is found.

Filename	Size	Update
第一次大作业-15数码\第一次大作业-15数码.cpp	5155	2018-11-02
第一次大作业-15数码\第一次大作业-15数码.exe	134911	2018-11-02
第一次大作业-15数码\第一次大作业-15数码报告-郭劭华16071119.docx	94406	2018-11-02
第一次大作业-15数码\第一次大作业-同心圆盘问题.cpp	2513	2018-10-30
第一次大作业-15数码	0	2018-11-03

• 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．