A message from our CEO about the future of Stack Overflow and Stack Exchange. Read now.

For challenges focusing on the optimization of an aspect not covered by other tags.

This indicates that the challenge involves optimization, which could be maximization, minimization, or something else. It might be performing some sequence of events in the most effective way, or it could be improving efficiency of retrieval or processing of input in a certain way.

Optimization puzzles should tend to focus on three areas:

  • There is exactly one observable parameter ("score") which measures the performance of attempting a puzzle in a particular approach. As examples, this could be a mixed function between code size, objectives reached (e.g. count from 1 to N where score depends on increasing N), constraints met (e.g. penalty on repeating characters), or any arbitrary but well defined set such as playing a game and measuring your score, etc.

  • The performance (measured score) involves the loosely computer sciencey definition of "optimization", that is a "better" approach works more efficiently or use fewer resources. (Resources is generally interpreted as code size on this site, but there may be alternatives.)

  • The problem does not have an obvious solution, i.e. solutions may compete on out-performing each other rather than solving the problem with the optimal methods. More specifically, in most optimization problems there exists a playing field that arises from having the output be a continuous function (i.e. for two similar approaches, they may be measured to be distinct from each other based on details) or the optimal algorithm is very hard to find / compute. (e.g. unit allocation)

Because optimizing code size already has its own field (), and optimizing output size is generally considered golf over a puzzle (e.g. ), optimization puzzles tend to target a different field, such as exploring a problem as deep / consistently as possible, or using less fuel to move a robot to a destination, sorting new structures which is graded by efficiency, or devising an algorithm to play a game and have your code try to reach as high of a score as possible.

history | excerpt history