From: brett l. <wak...@gm...> - 2009-12-22 22:19:35
|
We agree with you that route calculation is important, but so are many other things that are far easier to implement. If you're volunteering to write the code, great. Just let us know when to expect your first set of patches. Let me know if you need any help checking out the code so that you can get started helping us add this feature. ---Brett. On Tue, Dec 22, 2009 at 2:18 AM, Frederick Weld <fre...@go...> wrote: > Hi developers, > > I was wondering why this feature is prioritized so low. For me, this would > be THE reason to use the computer instead of a physical board. > > Is it that you need a good algorithm before implementing this? In such a > case, please consider the following: > (1) Even though the brute force algorithm wouldn't be in O(n^p), it will > probably be ok for non-diesel runs. > (2) What SimTex's 1830 (most probably) does: A separate model (multi-edge > graph) for route calculation is updated whenever someone lays a tile. By > doing this, you get a very low constant factor of the time the algorithm > needs, meaning you'll still have exponential time but you won't perceive > this until the size of the graph becomes very large. > > What do you think about that? > > Best Regards, > Frederick > > ------------------------------------------------------------------------------ > This SF.Net email is sponsored by the Verizon Developer Community > Take advantage of Verizon's best-in-class app development support > A streamlined, 14 day to market process makes app distribution fast and easy > Join now and get one step closer to millions of Verizon customers > http://p.sf.net/sfu/verizon-dev2dev > _______________________________________________ > Rails-devel mailing list > Rai...@li... > https://lists.sourceforge.net/lists/listinfo/rails-devel > > |