This system is quite simple but is giving me results:

Run 18 spins.

Note the number of occurrences of each split.

For the next batch of 18 spins you are going to bet that you will have one more appearance on each.

To all the splits that have one occurrence, you bet that the new set will have 2 on them.

To all the splits that have 2 appearances, you bet that they will have 3.

To all the splits that have 3 appearances, you bet that they will have 4.

And so gradually. So that when they are +1 from previous run it is a win.

The splits that do not come out in the first 18 sets are ignored for the latter.

My favorite method of progression for this method is just one piece up for the next run if this is run finishes in the negative.

When you get any profit by the current hit the betting closes immediately and it is time to start again.

It is very nice when a hit with two splits at the same time. They happen with some frequency.

The bets remain on the carpet up to spin number 18 expressly as final bound for the run.

Hopefully a software can soon be available to us for testing. Given the large number of splits locations to track it is cumbersome to carry manual counting to test let alone play live with paper and pencil with sixty splits.

A variation is to play only splits for the double-streets: 1-4, 2-5, 3-6.

The downside is that you lose the advantage of the double hit. Often it is what saves the game.

The last x splits program can be used for this system.

It is in the free software section of the forum.

Has anyone tried or better yet programmed this system? In my hand tests at home and then at the casino  the times I have used it went well.

Too many coins on table. It would be desirable a clicker for betvoyager, for example.

Thank you wannawin, lets try it.

Hello dear Walter,

I think the method didn't have interest because (perhaps) it was misunderstood. I read it myself and see ambiguity. Please tell me the one scenario you are trying to convey:

A) You bet all splits spun in first 18 on next cycle of 18 spins.

B) You erase all spins for the next 18-spin cycle, letting the hits add-up from scratch.

This is what I believe is needed to be explained in order to clear it. Because if it's A, then this is no different than "Bet all splits spun on previous 18 spins". If on the other hand it is B, then I see how it can have merit (even as we know it is still a mechanical bet). Kindly confirm!

Vic

Quote from: wannawin on November 14, 2012, 04:20:58 PM
To all the splits that have one occurrence, you bet that the new set will have 2 on them.

To all the splits that have 2 appearances, you bet that they will have 3.

To all the splits that have 3 appearances, you bet that they will have 4.

And so gradually. So that when they are  1 from previous run it is a win.

Walter, while not exactly the same I talked about a similar concept here:

http://betselection.cc/meta-selection-105/1-point-up-2-points-up-n-points-up-(above-the-rest)/

It's intended to be on numbers from the the same set yet I find the similarity interesting; as it's natural, the more numbers spun, the more cumulative hits expected. It's certainly a fine observation. Many systems can be made upon it. It runs throughout the game.

Quote from: jarabo002 on May 13, 2013, 02:51:02 PM
Too many coins on table. It would be desirable a clicker for betvoyager, for example.

Thank you wannawin, lets try it.

jarabo002, friend, I very respectfully say that I think you are someone who did not understand the system as a whole. You must observe to start adding just one split at a time often and pointers splits usually are rather scarce as we are divided into two sets of 18. It is common for splits to fall asleep. If you wish you can start from the second position to be discarding the once position to make them even less wagered locations.

Please receive affectionate thanks to you for showing consequence. It motivates me to see that it aroused some interest in my method.

Quote from: VLS on May 13, 2013, 03:42:38 PM
Hello dear Walter,

I think the method didn't have interest because (perhaps) it was misunderstood. I read it myself and see ambiguity. Please tell me the one scenario you are trying to convey:

A) You bet all splits spun in first 18 on next cycle of 18 spins.

B) You erase all spins for the next 18-spin cycle, letting the hits add-up from scratch.

This is what I believe is needed to be explained in order to clear it. Because if it's A, then this is no different than "Bet all splits spun on previous 18 spins". If on the other hand it is B, then I see how it can have merit (even as we know it is still a mechanical bet). Kindly confirm!

Vic

It is the option b above. If you read the explanation carefully you notice templates are two of 18 sets each to complete the full set of 36 of the entire game. It clearly indicates for the next batch of 18 spin we will use a completely new game template.

A timely question. Are you available to program this system?

If you are not so maybe you could help me with programming in Basic256? The logic would be very simple. Send a directory. Evaluate the system for each file that the directory contains and then give a full balance of the directory results. Not even with any graphs. With a numerical balance it is good to suffice me.

http://doc.basic256.org/doku.php?id=en:open

Thank you very much for any way you can assist me.

Thanks for clearing it up. I supposed as you were going the long explanation path it had to be B. As for the programming, I'm afraid I've got my plate full right now.

If you show me something you progressed on your own using BASIC256 I'll be very glad to help you get unstuck, but I can't code it all at the time (in other circumstances it would be my pleasure).

Quote from: VLS on May 15, 2013, 09:14:48 PM
Thanks for clearing it up. I supposed as you were going the long explanation path it had to be B. As for the programming, I'm afraid I've got my plate full right now.

If you show me something you progressed on your own using BASIC256 I'll be very glad to help you get unstuck, but I can't code it all at the time (in other circumstances it would be my pleasure).

Sorry I have nothing ready.


Could you tell me what would be the steps to create a tracker for this system? Could you give me some pointers to follow to program it. Thank you.

Quote from: wannawin on May 19, 2013, 01:56:23 PM
Sorry I have nothing ready.

No Prob. there's a starting point for everything 

Quote from: wannawin on May 19, 2013, 01:56:23 PM
Could you tell me what would be the steps to create a tracker for this system? Could you give me some pointers to follow to program it.

Sure. Language-agnostic. Using pseudo-code.

Pre-requisites:

- Two arrays in the form: Array[split] = hits -- Let's call them ArrayPast andArrayCurrent

- A function to determine splits from a number. -- Let's call it n2s() -Number to splits

- A function to rise hits on the passed array. -- Let's make it: addHit(Array, Splits)

Program:

- Loop over the last 18 spins, in order to populate ArrayPast:

for i = 1 to 18
    addHit(ArrayPast, n2s(number))

- On each new number spun, add a hit to ArrayCurrent

    addHit(ArrayCurrent, n2s(number))

- At this point you simply want to compare splits for equality in hits -on both arrays:

    For each split in n2s(number)
        If ArrayCurrent[split] = ArrayPast[split]
            AddToBets(split) // Your goal

---

Hope you grasp it. Anything, just shout.

I lost all understanding after array concept. I presume that this will be long. I did not understand most of what you said after array but please let me tell you what I do understand.

I do understand that the array is a collection of similar items grouped together. This really is what I have it clear. That is a set and I understand the concept of a set from my days of school. But how to save a split that is comprised of two separate numbers looking like one? What would be the code to put each of the splits as you would to discriminate between the splits that have repeated the same number as 16 # 17, 14 # 17, 18 # 17, 20 # 17? My question as my starting point if it is not too much trouble: How is the code for grouping the numbers with repetitions of the same in many splits?

Basic256 please.

Thank you for your help.

http://doc.basic256.org/doku.php?id=en:arrays

  Dear Walter, I'm working right now; pleae "ping me" back in a few days and I'll try to come up with some skeleton basic256 code for you to use as base/starting point.

The program itself is easy, that I can tell you for sure.

Quotehttp://doc.basic256.org/doku.php?id=en:arrays

Just saw further into can be read on the DIM page:

http://doc.basic256.org/doku.php?id=en:dim

I see basic256 doesn't have a "HashMap" datatype with a Key/Value pair such as:

http://docs.oracle.com/javase/6/docs/api/java/util/HashMap.html

What I grasp is you'll have to fake your own Split/Hits pair.

A quick way to do so, idiomatic to basic256, might be to create an array with 3 elements, one for each number in the split plus one for the count, then populating it; like this:

DIM split_1_2(3)

split_1_2 = {1, 2, 0}

DIM split_17_20(3)

split_17_20 = {17, 20, 0}