I'm ever so slowly working on two different things (though at the speed I'm going, I won't promise anything). One is a simulated annealing approach to solving the cube and the other is using pyglet and opengl to visualise the pieces in 3D. Not really putting too much effort into it at the moment, but having fun with it anyway :-) I suppose I should commit it to github, though its just tinkering and experimenting at the moment.
2010/7/25 Maciej Bliziński <[email protected]> > 2010/7/24 Maciej Bliziński <[email protected]>: > > I also finished the code generating all the rotations and all the > > positions. If you call the MatcherData() method of the AllTheWays > > class, you'll get the data ready for use for any solution seeking > > algorithm. > > I've made more progress: the first implementation of the recursive > backtracking search is working, albeit slowly. > > The existing code is here: > http://github.com/dublindan/pycon_cube/tree/visual-data > > The way to run the script is: > ./puzzle_tool.py -l > > So far, I haven't found a single solution. What do you guys think > would be the best way to improve this program? > > Maciej > > -- > You received this message because you are subscribed to the Google Groups > "Python Ireland" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<pythonireland%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/pythonireland?hl=en. > > -- Daniel Kersten. Leveraging dynamic paradigms since the synergies of 1985. -- You received this message because you are subscribed to the Google Groups "Python Ireland" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/pythonireland?hl=en.
