1051234567890500100015002000250030003500kC(k)KRSExplicit countFigure 17.9.Counts obtained by the KRS algorithm and by explicit count-ing for a4×4lattice. For KRS we set the probabilities to0.5, the number of stepsbetween records to±=4, and the total number of steps to105. Because±was sosmall, the samples were highly correlated, but the estimates are still quite good.C(0)C(1)C(2)C(3)C(4)C(5)C(6)C(7)C(8)2×21422×3171133×31124456184×41242241044259333882150552366×616016222617228151421353561178538248145820146702793(b) One of the more interesting programming issues in this problem is thedatastructure.•If we keep track of eachedgeof the lattice, then we need to enumerate rulesfor deciding whether two edges can be covered at the same time. For example,
This is the end of the preview. Sign up
access the rest of the document.
This note was uploaded on 01/21/2012 for the course MAP 3302 taught by Professor Dr.robin during the Fall '11 term at University of Florida.