Hard-coded segmentation

Jump to navigation Jump to search

I was referring to hard-coded bins, not hard-coded weights. Although Combat also uses runtime std. dev. based weights.

Tuning against a known population is clearly stronger than runtime estimation of std. dev. It would only be weaker if the population was constantly changing.

But having different sets of weights for different opponents seems to have potential. Forward speed is more important against rammers than wall distance. The opposite is true for non-rammers. But selecting which set is optimal against each opponent is tricky without hard-coding opponents names.

MN (talk)18:37, 6 December 2013

You do not have permission to edit this page, for the following reasons:

  • The action you have requested is limited to users in the group: Users.
  • You must confirm your email address before editing pages. Please set and validate your email address through your user preferences.

You can view and copy the source of this page.

Return to Thread:User talk:MN/Hard-coded segmentation/reply (5).

I posted that a long time ago. Only long after I learned the close relationship between bins, k-NN and kernel density.

MN (talk)18:49, 6 December 2013