   Taking random puzzle peices and solving ?
  I was wondering if anyone knows what someone would use to automatically solve a randomly generated puzzle with differn''t edges and stuff... Rotated differnt directions ect ect... Does anyone know what one would use to make it so it has an automatic solve feature 
  Yes, it''s basic stuff. There are several ways to do it, but one pretty simple and working is breath first traversal. You first have the initial puzzle position. Then by using all legal and possible moves, generate a list of new puzzle positions. Then for *each* of these new puzzle positions, generate a new list of new puzzle positions. Do this until you reach a goal state, where the puzzle is solved. Then the search branch that found the goal state is the solution.If every legal move has the same cost, this will find the optimal solution. ;  That really depends on the size of the puzzles state space. If we''re talking about a jigsaw type puzzle made of polygons (Eternity Puzzle for example) then you''ll find that the state space is too big to solve using simple breadth first search, or any other search algorithm for that matter. In such a case, you''ll need to do something a little more complicated.However, before we can suggest specific methods optimised to your puzzle, we need to know a little more about the sorts of puzzles you want to be able to solve. Could you give us more information please?Cheers,Timkin 