This class is a history table for our 'killer heuristic'. It remembers moves that have proven effective in the past and is later used to prioritize newly generated moves according to the effectiveness of the particular move in the past.

	initialize
	atAllPut: clear

	sorting
	sorts:before:

	accessing	top
	addMove:

	initialize	top
	atAllPut: Fill the receiver, an indexable bytes or words object, with the given positive integer. The range of possible fill values is [0..255] for byte arrays and [0..(2^32 - 1)] for word arrays.
	clear

	sorting	top
	sorts:before:

	instance creation	top
	new Answer a new instance of the receiver (which is a class) with no indexable variables. Fail if the class is indexable.