The algorithm can be programmed without the use of multiplication or division. It was found that 333 core locations were sufficient for an IBM 1401 program (used to control an IBM 1627). The average computation time between successive incrementations was approximately 1.5 milliseconds.
No takes yet. Share an insight, caveat, or question.
Jack Bresenham (1965) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: