Generating a value associated with one of a plurality of leaf nodes by implicitly randomly climbing an implicit tree having the leaf nodes

摘要

Provided are a method, system and article of manufacture for generating a value associated with one of a plurality of leaf nodes by implicitly randomly climbing an implicit tree having the leaf nodes. A determination is made of an ancestor node of a current node, wherein each ancestor node at a level of the ancestor node is associated with a different set of ordered leaf nodes, wherein there is a unique value associated with each leaf node. A determination is made of a first leaf node of the ordered leaf nodes associated with the determined ancestor node. A determination is made as to whether the determined ancestor node is a rightmost ancestor node at the level of the ancestor node. A first formula is used to determine a last leaf node of the ordered leaf nodes associated with the determined ancestor node in response to determining that the ancestor node is the rightmost ancestor node. A second formula different form the first formula is used to determine the last leaf node in response to determining that the ancestor node is the rightmost ancestor node. A value associated with a selected leaf node is generated that is between the determined first and last leaf nodes in response to determining to climb to the ancestor node of the current node and in response to determining not to climb to a further ancestor node of the determined ancestor node, wherein the generated value is used in a computational process.