i want a complete c++ program with your own DFS algorithm *as simple as possible* to solve the following problem. We have a sliding puzzle with one black,two white tiles and an empty space B_WW. The order of operators are: A tile can move to an adjacent empty location (cost 1) A tile can hop over one tile (cost 1) or hop over 2 tiles (cost 2) The goal is to have all white tiles to the left(dont care for empty position) The output of the program should be like plain English instructions ie: 1)blank tile slides one position to the right 2)blank tile hop over one tile to the right 3)... 4)... 5)Goal: i.e WWB_

This entry was posted on Friday, November 27th, 2009 at 11:25 am and is filed under C/C++, Projects. You can follow any responses to this entry through the RSS 2.0 feed. Both comments and pings are currently closed.