BGonline.org Forums

Greedy bearoff question

Posted By: NJ
Date: Sunday, 1 January 2012, at 12:10 a.m.

In Response To: Greedy bearoff question (Michael Depreli)

It wouldn't be hard to write a program to do this, but there are a large number of positions/rolls to check:

Number of possible bearoff positions (each side) = 21 C 6 = 54264 Number of rolls per position = 21

Total # to check = 54264 * 54264 * 21 = 61,836,215,616

My guess is that it would take days for a program like this to finish.

Also, would you discard positions/rolls where there is no unique greedy move?

Messages In This Thread

• Greedy bearoff question
  Michael Depreli -- Friday, 30 December 2011, at 8:46 p.m.
  • Greedy bearoff question
    NJ -- Sunday, 1 January 2012, at 12:10 a.m.
  • Greedy bearoff question
    NJ -- Sunday, 1 January 2012, at 1:34 a.m.
    • Greedy bearoff question
      Michael Depreli -- Sunday, 1 January 2012, at 9:41 a.m.
      • Greedy bearoff question
        NJ -- Sunday, 1 January 2012, at 8:21 p.m.
        • Greedy bearoff question
          Bob Koca -- Monday, 2 January 2012, at 2:55 a.m.
          • Greedy bearoff question
            Bob Koca -- Monday, 2 January 2012, at 3:04 a.m.
  • Greedy bearoff question
    Bob Koca -- Monday, 2 January 2012, at 3:22 a.m.
    • Greedy bearoff question
      Michael Depreli -- Monday, 2 January 2012, at 9:01 a.m.
    • Greedy bearoff question
      jdg -- Thursday, 29 August 2013, at 2:37 p.m.
      • Greedy bearoff question
        Taper_Mike -- Friday, 30 August 2013, at 9:31 a.m.
  • Greedy bearoff question
    Ian Shaw -- Tuesday, 3 January 2012, at 4:23 p.m.