Difference between revisions of "ScalarN/Version History"
< ScalarN
Jump to navigation
Jump to search
m (4x faster kdtree!) |
m (fix) |
||
| Line 14: | Line 14: | ||
** Fully redesigned ''Unit'' module that provides a unified model for all robots in battlefield | ** Fully redesigned ''Unit'' module that provides a unified model for all robots in battlefield | ||
** ''Primitive Collections Framework'' that feels the same as JCF but much faster and compact for primitives. | ** ''Primitive Collections Framework'' that feels the same as JCF but much faster and compact for primitives. | ||
| − | ** My own KdTree which is 33% faster than order version (in ScalarNext). It's also 4x faster than Skilgannon's KdTree (k=250 , n=50000) for the use of ''Primitive Collections Framework'' (I guess). | + | ** My own KdTree which is 33% faster than my order version (in ScalarNext). It's also 4x faster than Skilgannon's KdTree (k=250 , n=50000) for the use of ''Primitive Collections Framework'' (I guess). |
Revision as of 04:36, 18 August 2018
- 0.01 phase 2 (August 03, 2018 – ) Developing
- Melee movement between minimal risk and wave surfing
- 0.01 phase 1 (July 20, 2018 – August 03, 2018)
- State-of-the-art melee radar that maximizes scan rate
- Unified design for melee and duel
- Graceful handling of out-ranged robot, supporting even 5000x5000 battle field!
- State-of-the-art melee radar that maximizes scan rate
- 0.01 phase 0 (July 09, 2018 – July 20, 2018)
- Lightweight Log4j style logging for robot and corresponding Intellij plugin
- BaseRobot — AdvancedRobot alternative, decoupling bot implementation from robocode
- Subject/Listener style component communication, and bind together automatically via ListenerRegister module!
- 2D vector library V inspired by PyTorch; Math library U that unifies math/geom API.
- Fully redesigned Unit module that provides a unified model for all robots in battlefield
- Primitive Collections Framework that feels the same as JCF but much faster and compact for primitives.
- My own KdTree which is 33% faster than my order version (in ScalarNext). It's also 4x faster than Skilgannon's KdTree (k=250 , n=50000) for the use of Primitive Collections Framework (I guess).
