EventHorizon

VIP
  • Content count

    512
  • Joined

  • Last visited

Community Reputation

7

About EventHorizon

  • Rank
    Senior Member

Profile Fields

  • Gender
    Male
  1. So the best you can do is 00 00 or 0 0 ... 0 0 000...00
  2. Looks like I misunderstood the initial configuration. I assumed the x's were already amoeba and not just space to vacate.
  3. Example 2 is not looking good. Perhaps it is unsolvable....
  4. Yay for integer sequences (found using your 19355 )... Time to look at 3-regular graphs... which aren't as simple and quite possibly don't have this property. So it looks like we basically just need to find how many 8-regular graphs there are with 26 labeled vertices. It'll be off by a little, but will be a good estimate for N.
  5. N is not going to be that simple to calculate. Any given adjacency you find could have multiple possible cycles that could be found within it (So it may incorrectly be counted multiple times). Adjacencies don't need to be as neatly organized as curr3nt's answer was.
  6. I think the bit debt idea will always have situations that produce contradictions, so I'm thinking it should be discarded. I looked over plainglazed's 38, and I think it works. Nice. Edit: I got another 38. It's slightly more complicated (1 more branch needed), but is based on yours, so I won't bother posting it. It uses 6of8's and 5of8's in combinations instead of groups of 5's in a bigger group of 20.
  7. I didn't really explain it too well. Here's a (hopefully) better attempt to show that with 3 bits of information, you can get 4 of the next 5 cards right and still end up with 2 bits after A couple examples Example 2 shows that this method does not work as I thought it did, since I reached a contradiction. So back to the drawing board... hopefully something from this can be salvaged. I think it may still work, but that I can't 'borrow' quite as many bits as I thought. I think there needs to be a 1 bit buffer at all times. Hopefully that solves the issue, but I'll need to look into it.
  8. So, after reading your post and looking at the fewest for 3 again. I thought of one configuration to try. Since testing a configuration with my code is fast, I threw it into my code and...
  9. I wondered where I could get that extra bit... v v v v v doesn't work
  10. I've got a strategy that gets 38 (or more) on 99.8% of decks, and needs one more bit on the rest... one bit... grr. Edit: Hey... 500th post! v v v v doesn't work Edit 2: I got a strategy that guarantees 38. I'm going to flush out this idea before posting (hoping I can get 39).
  11. Think that logic is sound. 37 anyone?