Partition Test

The classical poker test considers n groups of five successive integers {Y[5j], [5j+1], ..., Y[5j+4]} for 0 <= j <= n and observes which of the following seven patterns is matched by each 5-tuple: All different: abcde One pair: aabcd Two pairs: aabbc Three of a kind: aaabc Full house: aaabb Four of a kind: aaaab Five of a kind: aaaaa A simpler version is implemented and compromise simply to count the number of distinct values in the set of five. There are five categories: 5 values = all different 4 values = one pair; 3 values = two pairs or three of a kind 2 values = full house, or four of a kind 1 value = five of a kind The function returns a uniform random no. in [0,1]. The test is failed if the value less than 0.001 or larger than 0.999