DE102006003843A1 - Random event e.g. random number, creating method for e.g. gambling machine, involves effecting establishment of succession of arriving action signals with respect to event, and assigning signals are assigned as data to produce number - Google Patents

Abstract

The method involves effecting an establishment of a succession of a temporally arriving action signals with respect to a random event through a protocol device. The establishment and/or data for a time point of the arrived random events is evaluated to produces a random sampling among a set of participants. The signals such as digit or number or direct address of the participant are assigned as data to produce a random number.

Description

Background:

The The invention relates to an electronically processed method for Generating a random event according to the preamble of the claim 1. For example a random number, especially for gambling machines of various kinds Versatile applications. Especially for an implementation as gambling Robots in the network, e.g. on the Internet with access for any number of participants, who can participate in the game. Besides the possibility a random number or number series (e.g., as drawn lottery numbers or for a raffle, etc.) to produce, the invention can also primarily used to immediately rank the winners from the Amount of all participants by random to certain (zu pull) or even by coincidence, a time to generate which exclusively by accident and for example for another Game can be used, etc. For all applications, however, the Coincidence exclusively dependent be from the participation of all participants, so that the game will not be manipulated can.

was standing Technique: closest to the invention, is the known device of a gambling machine, which works on the principle of rotation, in which the quantity the selection elements rotates (see Lotto drum, roulette, Daddel gambling machines, etc.) and then made the selection by an access element will be the lucky one Determine winners. The selection is by mechanical Friction, or electronic simulation such as through a random number generator, etc. affected. In which it can not be avoided that these influencing as always, also manipulable. An access element can be a static device, as provided in a lottery drum, or depressions, as in a roulette, or even a stop button a Daddel slot machine, etc. Access to a selection element associated with the winner (e.g., a digit included in the player's prediction Number ball in a lottery drawing, etc.) is generally called Draw called. In this sense, falling also corresponds to one Roulette ball of a draw, etc., although it is also common by electronic random number generators a number sequence to be taken by the players in a prediction to generate.

Should The drawing is done electronically, which is state of the art using self-sufficient random number generators, then the draw is by the autarkic random generator manipulatable and difficult to verify, if not a manipulation is present. Because of this vulnerability, even today, in the Electronics age for Lotto draws preferred mechanical drums, which, however, also hard to see through, if not there is a manipulation.

This Invention solves this problem and allows for the first time the realization of a random generator, which is not is manipulatable, or if necessary manipulation attempts instead of finding this through a public accessible surveillance is detected immediately. For the application to a lottery drawing, it is thus possible for the first time that the teammates each themselves a lottery number (ball) represent and the lottery drum on the Networking of all players over the Internet through a non-manipulable, very simple algorithm over simple computer program, or even such a program appropriate hardware realization of digital circuit, etc., can be reproduced.

task Present invention is thus such a draw, or the generation a random number corresponding to the draw to select one or multiple players from the entire set of players under simultaneous (practically in real time) participation of all players like that make that the Random number generated by this participation of all players, or in affected by their result becomes. Respectively. if necessary, only a random time on this Is generated (depending on the use of the method).

The Generation of the random time thus corresponds to the access element a mechanical machine (such as a lottery drum), wherein As already stated, this random time depends exclusively on the participation of all players is generated, so that the game is not manipulated can be.

But this technical task, the mechanical access element of a mechanical machine (such as a lottery drum) by one of the participation of all players exclusively generated If it replicates the date of occurrence, a milestone for the electronic generation of random numbers for a machine intended for gambling already corresponds in its approach and is therefore firmly established in the solution of the stated technical problem in claim 1. This solution corresponds to the technical requirement that the generated random number is no longer possible to manipulate because of the participation of a large number of (competing) persons in their creation, and furthermore transparent realization of the method of "drawing" a winner down to the smallest detail can be.

there the process should be fully electronic, in particular on the Internet on one or more servers, the program flow while a draw also step by step Step all parties involved, or observers of the drawing process can be made transparent. In further education is to this Purpose the generation of a journal file provided that every program step while the draw records and over the internet can be accessed. Because the source code of the software it may also be verified by a notary with the assistance of experts. it is for this inspection it is sufficient to state that the random number is determined exclusively by the participation of the players arises and the software for the exit of the game does not make a single decision that is not made by the (equal) Participation of all players would be controlled.

• – Der Verwendung derartig erzeugter Zufallszahlen sind von der Anwendungsmöglichkeit keine Grenzen gesetzt und kann auch außerhalb von Glückspielen eingesetzt werden, z.B. um hierzulande bei einem Supergau eines Atomkraftwerkes in einem lupenreinen demokratischen Verfahren an den Flughäfen den Zugang zu den Flügen zu verlosen, wenn die Bevölkerung vor der ausgestrahlten Radioaktivität flüchtet. Oder auch um bei innerparteilichen Streitigkeiten, wer z.B. ein Ministeramt bekleiden soll (wenn die Experten schon alle verschlissen sind), oder sogar zum Kanzler gewählt werden soll (wenn alle Kanditaten schon freiwillig vor der Wahl zurück getreten sind), eine Auswahl nach dem Zufallsprinzip zu treffen, bei der die Öffentlichkeit transparent und überschaubar die Auswahl des Kandidaten (Ziehung) durch eine gemeinsam erzeugte Zufallszahl vornimmt.
• – Eine weitere Anwendung um mit der vorgeschlagenen Erfindung Zahlen nach dem Zufallsprinzip auszuwählen ist, neben der Anwendbarkeit für Lotto, nach Art der Ziehung von Zahlen einer Tombola die Richter in wichtigen Gerichtsverfahren zu bestimmen (dabei kommt jeder Richter in die Auswahl durch eine Nummer, die gezogen werden muß). Wie wichtig eine solche Anwendung wäre, sieht man im Fall Berlusconi in Italien, damit man den an solchen Verfahren beteiligten Richter nicht erst acht Jahre einsperren muß, um Klarheit zu bekommen.
• – Genauso wäre es auch zweckmäßig die Geschworenen eines Gerichtsverfahrens durch mit dem erfindungsgemäßen Verfahren erzeugte Zufallszahlen auszuwählen.

The preferred algorithm is deliberately kept simple so that it can generally be easily understood by the public. In this case, the server can be set up, for example, in an office or a notary, etc., etc. in addition to the server, a corresponding, also networked via the Internet protocol station.

• - The use of such generated random numbers have no limits on the application and can also be used outside of gambling, eg to give away in this case in a supergau of a nuclear power plant in a flawless democratic process at the airports to give access to the flights, if the population before the emitted radioactivity escapes. Or even in inner-party disputes, for example, who should hold a ministerial office (if the experts are already all worn out), or even elected chancellor (if all candidates have voluntarily resigned before the election), a random selection too meeting, where the public transparently and manageably makes the selection of the candidate (draw) by a jointly generated random number.
• - Another application to randomly select numbers with the proposed invention is, in addition to the applicability for lottery, to determine the judges in important court cases by drawing the numbers of a raffle (each judge being included in the selection by a number, must be pulled). How important such an application would be can be seen in the case of Berlusconi in Italy, so that the judge involved in such proceedings does not have to be imprisoned for eight years in order to be clear.
• In the same way, it would also be expedient to select the jurors of a legal proceeding by means of random numbers generated by the method according to the invention.

Next the industrial property right sought by this procedure in the description for a better understanding of the illustrated application example in Detail made further details partly by a copy right Icon (©) designated and according to UrhG § 69a (1) protected. These details (©) are as a design material of a program with which the present invention is realized, to see, cf., also UrhG § 69a (3).

The Claiming the copyright right refers to the in the application examples given for the realization of the invention Draft material. Here, the idea as such (i.e., the method used) is appropriate Main claim and the dependent claims the application protected, the exact realization according to the still specified design, through copyright.

Extended Object of the invention, to which claim 1, and in the development in the subclaims specified solution, is the participation of the users in the unpredictable event, which for generating or drawing a random number, or also Number series introduces, over interactive data network, such as the internet, or the television (TV) in conjunction with a networked on the subscriber side Phone, mobile phone, client IT computer, etc., to enable.

there on the one hand, the procedure concerning the program sequence should be so be transparent that the program flow, or also the program part, which is the draw of the random number or random number series, also be publicly tracked can (for example on the Internet) to experts from around the world the possibility to be able to control the process without being able to manipulate (also equipment ) Supported.

there can in training the program even under a programming environment can run on a debugger, taking on the debugger software itself Naturally can not be accessed to the locked input functions (to change the program can not crack). The entire program will be included in a further education version step for Log and log step to every game in a journal file thus seen, but not changed.

Preview:

• a) die durch das Zusammenwirken aller Teilnehmer (Mitspieler) erfolgende Erzeugung eines für alle Teilnehmer gemeinsamen Startsignals,
• b) die korrekte Echtzeitverarbeitung aller von den Teilnehmern jeweils an den Server (zur Bewertung) abgegebenen Aktionssignale (Kennsignale), insbesondere der den einzelnen Teilnehmern jeweils zugeordneten Echtzeitmessung der Zeitdauer, die zwischen der Erzeugung des Startsignals und dem Eintreffen des einem Teilnehmer, bzw. der Messung jeweils zugeordneten Aktionssignales (Kennsignales) eintrifft, inklusive der gegebenenfalls vorhandenen Offsetkorrekturen (vgl. später).

In particular, in this monitoring process during the execution of the program, the immediate processing of the input messages (hereinafter referred to as action signals or identification signals) of the players who participate in the draw, monitored in real time. As we will see later and will be explained in detail below, it is sufficient to monitor two processes, most autonomously with its own program (or program part) of the program flow:

• a) the production of a start signal common to all subscribers due to the interaction of all subscribers (co-players),
• b) the correct real-time processing of all of the participants respectively to the server (for evaluation) output action signals (identification signals), in particular the individual participants each associated real-time measurement of the time period between the generation of the start signal and the arrival of a participant, or the Measurement respectively associated action signal (characteristic signal) arrives, including the possibly existing offset corrections (see later).

• • Eine Softwarekomponente zum Aufzeichnen der Entstehung des Startsignals, wobei hier der Schwerpunkt der Überwachung die Entstehung des Startsignals unter Mitwirkung aller Teilnehmer betrifft,
• • eine kombinierte Hardware – Softwarekomponente (z.B. realisiert mit State-Machine und/oder einem DSP), welche die unverzögerte Weiterleitung der Aktionssignale (Kennsignale) unter Registrierung ihres Absenders an die Echtzeitmessung überwacht,
• • eine kombinierte Hardware – Softwarekomponente (z.B. realisiert mit State-Machine und/oder einem DSP), welche die unverzögerte Weiterleitung des als Zufallsereignis erzeugten Startsignals an die Echtzeitmessung überwacht,
• • die Echtzeitmessung selbst (z.B. realisiert mit State-Machine und/oder einem DSP), welche die Messung der Zeitdauer vom Eintreffen des von einem dem Teilnehmer jeweils abgegebenen Aktionssignales (Kennesignales) bis zur zufallsbedingten Erzeugung des Startsignals betrifft, wobei dies für alle Teilnehmer unter Berücksichtigung der zu den erhaltenen Kennsignalen der Teilnehmer jeweils zugehörigen Kennadressen für jedes erhaltene Kennsignal vorgenommen wird und diese Kennadressen beim Einloggen eines Teilnehmers jeweils den persönlichen Daten der Teilnehmer zugehörig durch den Server vergeben werden.

The monitoring (which goes right with the drawing) contains three components in further education:

• A software component for recording the generation of the start signal, the focus of the monitoring here being the generation of the start signal with the participation of all participants,
• A combined hardware software component (eg realized with state machine and / or a DSP) which monitors the instantaneous forwarding of the action signals (identification signals) by registering their sender with the real time measurement,
• A combined hardware software component (eg implemented with state machine and / or a DSP) which monitors the instantaneous forwarding of the random signal generated start signal to the real time measurement,
• • The real-time measurement itself (eg realized with state machine and / or a DSP), which relates to the measurement of the time from the arrival of each participant delivered by the action signal (Kenn signals) to the random generation of the start signal, for all participants under Considering the characteristic identifiers of the subscriber respectively associated characteristic addresses for each received identification signal is made and these identifiers are assigned when logging in a subscriber in each case the personal data of the participants belonging by the server.

This monitoring device let yourself also easily in multiple execution, at the individual devices Several times are available in a clearer Realize structure. So that anytime simply checked can be that the actually generated random number through the interaction of all players arises and further not is manipulatable.

• – Eine derartige technische Neuerung ist zeitgemäß und eigentlich schon längst überfällig. Denn so wie alle Lebewesen einmal aus der Verbindung von Einzelzellen entstanden sind, wird die gesamte Menschheit sich zu einem Wesen der nächsten Art zusammen schließen. Die vorliegende Erfindung schafft z.B. für den Lottospieler diese Voraussetzungen. Es gibt nicht mehr den passiven Einzelspieler, der passiv sich dem Ergebnis der Ziehung unterordnen muß, sondern den aktiven Spieler, der entsprechend der Entwicklung des "Metamenschen der Zukunft" das Ergebnis der Ziehung unter Zusammenwirkung aller Mitspieler mitbestimmt.

This in further development of the invention further taken security measures have the property that, despite the possible transparency with which the process can be operated, it may not be manipulated by possibly made during the game, software-supported attacks on the server, possibly existing attacker favored in the game. That is, the drawing method according to the invention can not be influenced in a concerted action of several attackers who want to manipulate the game computer based. The method is in addition to the applicability to any games therefore particularly suitable for lottery draws. It is to be regarded as particularly attractive for the other players, that not as before, the draw can only follow the TV visually, but can actively participate in the draw.

• - Such a technical innovation is timely and actually long overdue. For, just as all living beings have emerged from the combination of single cells, all of humanity will be united into one being of the next kind. The present invention creates such conditions for the lottery player, for example. There is no longer the passive single player, who must passively be subordinated to the result of the draw, but the active player, who according to the development of the "metahuman of the future" co-determines the result of the draw with the cooperation of all other players.

Solution of the task

The technical solution arises as always the claim 1. In particular from the others dependent claims for different applications and further developments of the invention.

Further Information on the prior art: The invention comes a well-known Procedure, technically closest, which uses a corresponding technical device at several candidates of a quiz show, each over one Terminal are networked with a computer (e.g., intranet, etc.) the To answer and determine answers (for example by ticking) which participants answer the correct answers the fastest can.

Such a method can generally be understood as an event measurement, ie an event (hereinafter referred to as start signal) occurs at the terminal or screen, each participant recognizing this start signal (eg the quiz questions) an action signal marked by the address of its terminal ( Identification signal) (eg to answer the quiz questions) outputs, the reaction time of the participants to this event is determined by the computer by measuring the time between start signal and identification signal. Thus, for the example given above, displaying the quiz questions corresponds to the start signal and sending the answers that are ticked by a subscriber to the identification signal, which, however, only applies to this example given. In principle, any desired event, eg displayed on a screen, can be defined as a start signal, the same applies to the action of the player to generate his action signal (identification signal), whereby the player steps through the address given to this identification signal (according to the indicated data). identified. Which can only be temporary, or eg by the procedure DE 10 2004 046 413.8 the same applicant may also refer to a telephone number of the player, etc.

One such a procedure could not so easy right over the Internet are applied because e.g. a player about software networked with several (unknown to the server) players involve could, furthermore a majority agreeing Answers of the teammates made assessment of a software could, to let them out automatically and be the fastest, etc.

Such and similar considerations are necessary to further develop the process according to the invention, that it for the each intended use case is protected against such attacks, d. H. Elimination of private networking outside the approved networking of the game are made. The others options To improve security, such as Fire Wall, etc., are here Outside left before because such measures anyway standard are.

Further explanation of the solution of the technical task and difference to the state of the art:

In The present invention also becomes a time entry of the participants determined by the computer (or by a server). The special however, it is because of that This new method does not require a simple time measurement between occurrences an event on the screen (start signal) and this event action answered by each participant (comparable a characteristic signal), in which the time measurements of the individual Participants to determine the shortest reaction time with each other are compared.

Rather it becomes the time to the event, which is the decision of the game (to determine the winner) brought about after randomly determined by all participants a non-manipulable Contribute to the game in real time, out of which the determination the time to generate a common start signal to all players derives. As we will see below, is through the following described technical measure for one such generation of the start signal with the participation of all players, a possibility of manipulation for the "draw", or production a random number excluded.

The technical measures therefor, which allow this priniciple are the subject of the invention and will be described with reference to the following explained Examples closer described.

Since all participants participate independently and above all in competition with each other in the creation of the play decisive all players common start signal, and in this way the time, on the one hand this event occurs on the one hand together, on the other hand determine independently of each other, in this way a real random number, or even a series of random numbers can be generated, which can be interpreted according to freely designed rules (eg as lottery numbers) to the winner of the game determine.

Also if a part of the participants using the existing Networking (e.g., via the Internet) should coincide at the time To manipulate, the exact time is determined by the remaining participants so determined that the exact time at which the start signal thus generated in common enters, is virtually impossible to manipulate.

When embodiment Two IT applications will be described, with two examples are provided: The drawing of a lottery ticket and a general Contest.

When Structural network is for Of course, these examples use the Internet, although the procedure is just as mobile phones or landline phones (with input via Number keys and eavesdropping acoustic messages, etc.) could be performed. Or also a corresponding combined settlement with simultaneous Use of different data networks can be carried out, including one Networking with a TV channel, where the TV as a screen is used and the phone for the feedback the player is used, etc.

The participants are (as usual) encoded with an address identifier of their terminals, which may also be temporary (as usual on the Internet) and only for the assignment of a player by manual input (or via the data loop of a telephone connection, see. DE 10 2004 046 413.8 ) is used. The use of a telephone number as an address complicates the realization of robots (for manipulation), since each player has to identify himself with the telephone number determined at the game.

Of the Term terminal is very spacious to understand: everything with which data (numbers, etc.) are entered can and messages are received visually and / or acoustically can is understood here as a terminal. Thus, e.g. also the given one Phone number of a telephone connection also regarded as a terminal become. Most comfort we receive, as always when we as Terminal IT networked computers using a browser software.

Generation of the random number (Embodiment):

• First, a randomly generated time ts or tref ( 3 . 4 ), over which the desired random number, or (depending on the application) a number series is derived, is used in this exemplary embodiment as algorithm a comparator function, in which a function S increasing over the time duration (curve S, 3 ), or also optionally decreasing function (optionally depending on the definition) with a value, eg a predetermined constant (or possibly variable) REF intersects and the time in which the intersection (S => REF, or possibly also S = <REF ), the randomly generated time, ts or tref ( 3 . 4 ), which is also referred to here as a start signal is generated. The function S (curve S, 3 ) arises with the participation of all participants (of the game).
• - Around from this random event generated time ts or tref (Start signal) the desired Random number, or (depending on the application) to get a number series, are the action signals (characteristic signals) whose cumulative effect the Increasing the function S each control data associated with which contains the set of numbers, from which a random number, or series of numbers is to be generated, i. to "pull" (or at random select) is. To get the drawn random number, or number series, is the temporal proximity the relevant action signals (identification signals) to as a random event generated time ts or tref (start signal) evaluated.

In special embodiment of the invention is the rising (possibly also falling) function S by states that of each participant (user) due to its access to the server, data concerning it, or values (dS), are summed into a sum S, such as Fees, debit amounts of one Account, or even only assigned by the server to the participants Partial amounts, if the amounts have already been paid in, such as at the lottery, etc.

These Values will be referred to below as participation summands dS, where S = sum of all ds of all participants. dS can do this for different Participants may also be different, etc.

Avoidance of manipulation:

In Continuing education is a special measure provided for opportunities to exclude for manipulation, the e.g. above a running on the client computers program are performed could. Such that one such program the server with automatically generated identification signals bombarded when the generation of the start signal becomes more likely is, i. the sum value S comes close to the reference value REF.

Around this basically To avoid is in training for the generation of the random number continue to hit the special technical measure that the identification signal by a certain minimum time tmin (e.g., 1 second, etc.) before the Time ts of over the subscribers generated start signal (e.g., S => REF) must arrive at the server valid to be evaluated. That the critical time to which a characteristic signal yet is evaluated, is tref = ts - tmin.

there the participants enter the identification signal at any time selected off, with the speculation temporally as close to the start signal to be that sometime later will arrive. In further education, tmin is still by a random principle generated, in which also all participants are involved later ) Will be explained. So that one Manipulation is absolutely impossible.

In order to the participants can also orient themselves, as close to the threshold as possible to the start signal, i. at the time of occurrence of S => REF (or optionally S = <REF), will the closeness to this point indicated by a suitable graph on the later even closer will be received.

All Identification signals, after which the later generated by the interaction of all players random start signal (S => R) still within the minimum time tmin (related to the respective characteristic signal) arrives, are thus invalid, i.e. are not rated. Only those still before the minimum time tmin, i.e. even before the time tref = ts - tmin incoming signals are rated, and the next at this time arriving at the server identification signal as by the random selected Identification signal evaluated.

If the summation of an amount of money to be won by the game, which corresponds to the reference value REF for the generation of the start signal in the case of the algorithm S => REF (or possibly S = <REF), is controlled by the characteristic signals, then the method becomes more interesting, if use is made of the following training option (as an additional optional supplementary variant):
The subscribers' balances arriving in the server by the subscribers (or by their participation in the game) in real-time from the subscribers, which via a continuous summation, the increasing function S for the starting signal to be generated as a point of intersection with a reference signal value REF by a comparator comparison ( S => R) are increased at the time at which a subscriber to the server an identification signal, concerning the affiliation of the subscriber increases, for example by multiplication.

If we assume in this example that the subscriber groups are formed, for example, via a charge clock of a telephone connection, or are also paid in monetary value, then this deposit takes place either via a modem connection or through a connection to a network connection via an IT connection a telephone connection, eg via a data loop of the DE 10 2004 046 413.8 of the same applicant (also for IT connections without telephone dial-in), this data loop being made via the paid telephone call and by checking one from the server over the loop [Server - Telephone - Client Computer Server] or [Server - Client Computer - Telephone - Senier] sent code the call is tested under a specific number to register the payment via telephone charges in real time.

In this example, the subscriber summaries can be evaluated as follows:
For example, the subscriber for logging in, or attempting to log in (depending on the modification used, see below), pays 30 cc, which are summed up as subscriber-associated subscriber summaries in the server to the current sum S, which the increasing function S for forms the start signal (S => R) to be generated as a point of intersection with a reference signal value REF by means of a comparator comparison. Wherein the game can be started only after reaching a certain number of participants, so that the increasing function S the reference value REF approaching pretty much (see registration phase in 3 ).

During the game the participant will give an identification signal, eg (depending on the application) in a game the sum of money S (after deduction of the commission of the event ters), then a higher value, eg 1 euro from the account of the subscriber, or a telephone charge, etc. will be deducted. These 1 euro are summed up like all in the server incoming subscriber sum to increase the sum S (which forms the increasing function S).

In the process, we obtain the following special technical effect, which we also refer to as an avalanche effect in the following:
The more participants attempt to reach the comparator threshold REF (S => R) via the increasing function S by inputting an identification signal, the faster the rising function S will increase. In this case, however, can not by an on a client computer or on several IT-networked client computers running robot software worthwhile for an attacker "firing" (ie the attempt to bring the profit of the draw by automatic delivery of the Kennsignals) when exceeding rising function S are triggered via the comparator REF, because then the certain minimum time tmin (eg 1 second, etc.) would not be met, ie it will then indeed reached the comparator, or the start signal (S => R) generated, however the relevant subscribers which have triggered the start signal (S => R) are too close in time to the start signal (S => R). In other words, those players who want to obtain an unfair advantage by using a robot software, only have costs (of use, since the delivery of the identification signal costs extra (eg 1 Euro).

at the application for a lottery draw, where the delivery of a Kennsignals gratuitous is done, there are other measures provided for the predetermination or the bringing about of the Coincidence event impossible close. For example, by pulling the number each time you drag within a random series and the position of the dragged number within that row the previous drawing process as a random number to the pulled Number is pulled with. That the number drawn is determined by the random determination of a series of numbers, with finite, predefined number of numbers, which consists of a long stream of numbers with undefined number over the current draw is determined by chance and a position number, which by the previous drawing (also at random) each was pulled with and the position of the number within the Series determined. Thus a nested drawing (drawing in the Drawing). For this prinizip becomes independent from the main claim continues to seek general, independent protection.

in the Plain text means that, not the participant, which those participant numbers, the the transgression (S => R) the rising Function S (as sum of all participant summands) triggers by he attached the server to him (ditto the Teilnehmerandsummanden dS associated) sends identification signal, determines the determined random number, but the random number becomes determined by the participant (TREFF), after deduction of the Minimum time tmin (e.g., 1 second, etc.) closest in time to from the server by the excess (S => R) the rising Function S generated start signal (S => R) is located. Taking into consideration this from the actual Minimum time to deduct time tmin all after the server generated Start signal (S => R) arriving characteristic signals are no longer valid. Do not just one Random number, but a whole number to be determined, then become to the first obtained random number corresponding to that participant (TREFF), which, after deducting the minimum time t min (e.g. 1 second, etc.) is closest to the start signal generated by the server (S => R), nor the participants immediately behind, with the numbers assigned to them as valid random numbers within a series with a defined number of numbers, where if necessary, one of the chronological order (corresponding to the time grading) appropriate rating can (TREFF1, TREFF2, TREFF3, etc.); or it will each time (with multiple Repeat) only one number (number) drawn like a lottery drum and made use of the extended procedure that by the previous draw the position of the drawn number within the series TREFF1, TREFF2, TREFF3 ... TREFFn is determined (where n a defined number, e.g. 100, etc.). For example at the (each) previous draw to the number drawn (e.g., lottery number) still the position, e.g. 33, pulled, then TREFF33 is the pulled Number, or a specific address of a randomly found, or "pulled" storage space, in which the data of the dragged value (in any number and for any further use) are stored.

Depending on the type of game (eg Lotto), the determined random numbers correspond, for example, directly to the participants assigned numbers that are freely selectable before the game or during the game by the participants. Wherein the "draw" according to the ranking of after deduction of the minimum time tmin (eg 1 second, etc.) in the valid range, ie temporally before the start signal (S => R) arrived by the characteristic signals between the Kennsignalen and the random event generated Start signal respectively measured time values, starting with the shortest time as the first value TREFF, the following grö ßeren time value as the second value TREFF-1, the subsequently still greater time value as the third value TREFF-2, the series of hits is determined, etc.

Example:

Relative to the time at which the start signal (S => REF with increasing signal S, or S = <REF with decreasing signal S originating from a setting value) is generated, for example, the following subscriber numbers (with the associated subscriber addresses) are in the server preorder:
Seven addresses ADD1, ADD2, ADD3, ADD4, ADD5, ADD6, ADD7, which are 0.7, 0.8, 1.1, 1.1, 1.2, 1.3, 1.7 seconds before the time of generation of S => REF, and another ADD0 address that time (as a start signal) triggers by the ADD0 associated Teilnehmerumsummanden, eg 1 euro, to help that the current value of the rising function S, for example, stood at 999,999.20 euros before the arrival of this value (which the participants but not at this time is displayed), the value 1000.000, 20 Euro and exceeds the reference value of 1000.000,00 Euro (assumed as an example) thus, whereby the start signal (S => R) is triggered by the server.

• ADD0 = 0.0 – 1 Sekunde = –1.0 Sekunden
• ADD1 = 0.7 – 1 Sekunde = –0.3 Sekunden
• ADD2 = 0.8 – 1 Sekunde = –0.2 Sekunden
• ADD3 = 1.1 – 1 Sekunde = 0.1 Sekunden
• ADD4 = 1.1 – 1 Sekunde = 0.1 Sekunden
• ADD5 = 1.2 – 1 Sekunde = 0.2 Sekunden
• ADD6 = 1.3 – 1 Sekunde = 0.3 Sekunden
• ADD7 = 1.7 – 1 Sekunde = 0.7 Sekunden

If, for example, a minimum time tmin of 1 second is taken as the basis for the evaluation as a fixed calibrated time, then we obtain the following measured time values between the start signal and the characteristic signal:

• ADD0 = 0.0 - 1 second = -1.0 seconds
• ADD1 = 0.7 - 1 second = -0.3 seconds
• ADD2 = 0.8 - 1 second = -0.2 seconds
• ADD3 = 1.1 - 1 second = 0.1 seconds
• ADD4 = 1.1 - 1 second = 0.1 seconds
• ADD5 = 1.2 - 1 second = 0.2 seconds
• ADD6 = 1.3 - 1 second = 0.3 seconds
• ADD7 = 1.7 - 1 second = 0.7 seconds

The first three values are negative, i. in relation to the time of Start signal (S => R) considering the minimum time tmin (of 1 second) is too late and therefore will not work anymore rated.

Consequently is ADD3 with 0.1 seconds the start signal (S => R) still sufficiently ahead in time the next. ADD4 has the same value. Would e.g. the value of zero Seconds occur, then is a matter of definition, if this value is still as the start signal (S => R) leading and therefore as the first value of the series of hits or already as the start signal (S => R) lagging and therefore invalid Is evaluated.

ADD5 receives with 0.2 seconds thus the third place. If e.g. a series with three random numbers are to be determined, all remain behind Values disregarded. Will the procedure for a lottery draw, then the multiple (in time) equivalent dragged participant addresses, as in this example ADD3, or ADD4, or their given with the action signal (identification signal) with Data (which correspond to the numbers drawn) as valid lottery numbers interpreted, with correspondingly less draws, or it will be additional Drawings inserted where the numbers of equivalently drawn addresses proportionally homogeneous to the participants be distributed and pulled again, with the two equivalent Also pay a position (for example, 1 and 2, with several equivalent ones 3, 4, ... etc.), which can also be assigned from the participants are drawn to repeated equivalency another statement about to make the position. In principle, the process can be repeated until at equivalent drawn participant addresses only one more is certain.

Of course they are only for this explanation so few participant addresses specified. In reality, these are Naturally Thousands to several millions.

It is interesting, that eg only through the last thousand attempts by delivery of a start signal (S => R) to catch the profit, on the reference value of (in this example) 1000.000,00 euro eg still missing 3000 euro of the rising function S within 0.6 seconds, for example, and thus the switching signal is generated, but that in the process that subscriber receives the profit which, while maintaining the minimum time tmin (here eg 1 second) at the time of exceeding the reference value (R = 1000,000.00 Euro ) generated start signal (S => R), the start signal is closest, and these are not the participants who have brought the missing 3000 euros within 0.6 seconds. But eg as indicated in the above example, that is the subscriber (ADD3), or are those subscribers (ADD3, ADD4) the, or the random 1.1 seconds before the generation of the start signal (S => R) after deduction of Minimum time tmin (in this example, 1 second) is the start signal (S => R) with the signal leading the next, or are. Since the participants are not aware of the time tmin (which could be as short as 0.5 seconds), and differ from game to game, it could be natural that at tmin = 0.5 seconds, the decision will bring those participants who are among the still missing 3000 euros were and the crucial Kennsignale delivered. That is, when the game is finally decided, the participants learn only when generating the start signal (S => R).

The Minimum time tmin varies from game to game and is considered the very first Play by a usual Software Random Generator (within a certain range) generated, for All other games can be tmin in addition to those through the process drawn numbers are drawn to them in the next game (of course, strictly kept secret) each.

Out the sequence of the procedure shows that all until the generation of the Start signal (S => R) subscribers incoming to the server (e.g., as a charge or Debit value, etc.) until exceeded of the reference value (i.e., until the start signal S => R) is generated as a random number generated participants (here ADD3) are attributed. The optionally still immediately after the crossing of the reference value resulting subscriber numbers are also adds up and results in a new sum, or new increasing function Snext as the basis for the next Game.

Option Setting the Reference Value by Participants:
An option is provided in which the participants register for the game a few days in advance, so that the registration fee forms a financial base of the sum S, wherein initially no reference value REF is exactly defined. Only when the application stagnates, the reference value REF is set slightly above the sum current sum S and the game can begin (see later 3 ), whereby the participants receive an email or SMS in advance to know the start of the game.

• – Der Referenzwert REF und die aus aufsummierten Teilnehmersummanden dS bestehende ansteigenden Funktion S werden über einen Gleichgewichtszustand dargestellt, z.B. über das Symbol einer Waage. Auf der einen Seite der Waage befindet sich das Gewicht des vorgegebenen Referenzwertes REF, auf der anderen Seite das Gewicht der ständig ansteigenden Funktion S.

Before going into further details of this game, further protection features for the general implementation of the method in a desktop display should be discussed.

• The reference value REF and the rising function S consisting of accumulated subscriber summands dS are displayed via an equilibrium state, eg via the symbol of a balance. On one side of the scale is the weight of the predetermined reference value REF, on the other side the weight of the constantly increasing function S.

The Extent of Deviation (ratio or also difference, (so exactly it does not work here, since it only on the value exceeded arrives) is indicated by the inclination of the balance. Achieve the rising function S the reference value REF, then the balance just. If there is still a small value, the balance is light the reference value REF is inclined, with greater deviation is the inclination bigger, etc. This is until the time before the generation of the start signal (S => R), i. so long the increasing function S is smaller than the reference signal REF, all players or participants will see the same picture. Only immediately after the generation of the start signal (S => R) is a distinction made in a winning picture, and a picture, which the remaining participants is shown.

• – Das Siegerbild zeigt die Waage waagrecht. Wird eine hierarchische Reihe von Gewinnern ermittelt, z.B. erster, zweiter, dritter, dann kann das Siegerbild noch weiterhin unterteilt dargestellt werden, es wird später darauf noch zurückgekommen.

The winning picture is displayed to the participant who, after deducting the minimum time tmin, is closest to the starting signal (S => R) or to the participant who has drawn the random number. See ADD3 with 01. seconds in the example above. Or, if the position within a drawn row is still evaluated, then the winning picture is displayed to the participant corresponding to that position.

• - The winning picture shows the scale horizontally. If a hierarchical series of winners is determined, eg first, second, third, then the winning picture can still be displayed divided, it will come back later.

• – Für die Verlierer, die zu nahe dran waren (somit in den Bereich von tmin fallen) wird die Waage übergewichtig in Bezug auf die ansteigende Funktion S geneigt, und es wird angezeigt, daß das Spiel beendet ist. In 1 und 2 bedeutet das, der Balken 4 liegt auf der rechten Seite (S- Seite) am Boden B auf (α negativ).
• – Für Verlierer, die zeitlich hinter dem Sieger liegen, bleibt die Waage übergewichtig in Bezug auf den Referenzwert REF nach links geneigt, und es wird angezeigt, daß das Spiel beendet ist. In 1 und 2 bedeutet das, der Balken 4 liegt auf der linken Seite (S- Seite) am Boden B auf.

The picture which is shown to the other participants can also be divided into two variants (as an option): Here we distinguish between the losers who were too early with the input of the identification signal, ie in relation to the proximity to the start signal (S = > R), are behind the winner, such as ADD5, ADD6, ADD7, see above (if only one winner, or as in the above example, shared at equal times ADD3 ADD4 victory) is possible, and those who were too late , dhdh were too close in time (related to the proximity to the start signal (S => R) (because of the deducted minimum time tmin), see in the above example ADD0, ADD1, and ADD2.

• For the losers who were too close (thus falling within the range of t min), the scale is overweighted with respect to the increasing function S, and it is indicated that the game is over. In 1 and 2 that means the bar 4 lies on the right side (S side) on the bottom B (α negative).
• For losers past the winner, the balance remains overweight relative to the reference value REF tilted to the left, and it is indicated that the game is over. In 1 and 2 that means the bar 4 lies on the left side (S side) at the bottom B.

And now to the game © Roman Koller (Inventor and applicant and author):

The game will be explained in the following in pictures, taking further training options of the invention:
For example, the game is a FLASH movie. This movie is protected according to the UrhG §95 (concerns moving pictures) according to the script design © given below: This includes the pictures 1 and 2 and 6 ,

The Libra is represented by a bar (as a swing), which in the center by a round wood (tree trunk, etc.) as a fulcrum supported is. On one side (for example, the left side, it could of course be the same the right side) is a money bag laid, the weight of which Reference value REF corresponds, which corresponds to the reference value Sum, e.g. on the wallet is clearly visible written on it. On the other Side of the swing (or the bar) jump constantly small Monkeys, e.g. from a tree on the swing and make it fax, etc. can the monkeys also in a vessel, or into a basket (option), etc., or even coins in throw the basket to the sum S according to the number of participants Sum up action signals (characteristic signals).

The Monkeys, as you have already guessed, symbolize the participants of the game, or rather the sums of money to each participant received. Mathematically symbolize the individual monkeys respectively the accumulated subscriber sum around the increasing function S, e.g. by sums of money thrown into the basket. In which the beam on the side of the basket becomes heavier as a result and against the weight of the purse (the one on the other side of the bar).

If the swing (Libra) slowly moves towards the horizontal line moves, means that, that the value of the rising function S (that is the value of the action signals, or identification signals corresponding to coins) the reference value REF (the money) already approximates strongly. As the participants of the game know that you because of the time tmin, on the one hand, as late as possible, or the latest, On the other hand, however, necessarily before the arrival of the accidental event (S => REF), which the start signal generates its action signal (identification signal) to the server have to give up will be the already mentioned Avalanche effect, in which the players through their greed, to capture the purse, bring about the accidental event (S => REF) and immediately before because of the compressed delivery of the action signals (Kennsignale) the ape circus particularly invigorate. For the option, in which the delivery of the action signals (identification signals) with a direct Deposit of the sums of money Therefore, the flow of money will increase with the avalanche.

at the display of the inclination of the swing is of course taken into account, that the Monkeys, or the coins thrown into the basket, yet are not that heavy, i. e. remains of the incoming funds for the Monkey people only a certain percentage left over (the against the weight the money bag is weighed), the rest is distributed to the Operator of the WEB site, if necessary, on those involved in the checkout Telephone companies, credit card companies, banks, etc .. That it's like in real life. Maybe it will a little bit what kind of a good cause, and above all the inventor is allowed to do this Game in terms of intellectual property and copyright also not forgotten become.

To The beginning of the game is the beam of the beam balance on the side of the Money bag at the bottom and the monkey basket at the top. It can during the Login phase of the bars also with the right side (S-side) below rest as long as only sums of money as registration fee be paid. Prerequisite, communicated the beginning of the game to get is the registration. Is enough money paid in for the first one, then falls the purse (REF) on the left side of the bar and the game starts at the announced time.

As later in more details too 1 and 2 and is described at the end of the description, the reference value REF can also be controlled by a random principle rocking high, but several times the also exclusively controlled by the random principle proximity of the sum value S => REF with a real (statistically predefinable) probability occurs. There is a real non-manipulable also controlled by the interaction of all players probability each to generate the start signal by the occurrence of the event S => REF and to capture the profit (ie, the reference value REF to zero again) before the reference value REF goes up again , Or just too not to produce, ie not to capture the profit, whereupon the reference value REF goes up again, etc.

there is called each time the sum value S approaches the reference value REF increasing intensity of the monkey circus, i. with an increasingly increasing function S the swing scales are tilting slowly, i. the monkey basket sinking and the money bag lifted. It is characterized by the "energy" with which the monkeys each on the bar jump, the beam first give in more to one impulse and then again his the weight ratio to the money bag appropriate inclination take. That the more monkeys jump on the bars on the monkey side, the higher they can raise the money bag at the other end of the bar.

This is done until the profit adjusted amounts, which are added as a sum of the weight of the monkey, the value of the bag (ie reference value REF) or exceed. At this moment, the start signal (S => R) is generated and the following evaluation is carried out for the further display of the image:
Case 1 relates to the case of those subscribers who have submitted the identification signal at a time that, although still immediately before the (or for the triggering participant exactly the) time of triggering the start signal (S => R) correspond, but already within the time interval for the minimum time tmin (see above AD0, AD1, AD2) and therefore (after deducting this minimum time tmin) are already too late.

For the participants involved in Case 1, the following message appears on their screen:
The balance beam jumps up spontaneously on the purse side (because the monkeys are too heavy) and the purse falls down and rolls out of the picture. Thus, the participant or user knows that he was late.

The same picture also see all participants who are still after the release of the Start signal (S => R) on Enter the identification signal, but then the according to this Associated participants Participant summons no longer the current increasing function S, but as a starting sum to form the function S for the next Game used (after profit adjustment, or deduction of the required holdings).

Case 2 relates to the case of those participants who the identification signal Although delivered sufficiently early in relation to the minimum time tmin but in relation to the winners or at the time of the Start signal S => REF still too early and therefore did not receive any profit. That still in time before the winners ADD3, ADD4 and ADD5, cf. previously explained example. Thus, this applies to ADD6 and ADD7 for this example.

For the participants involved in this Case 2 case, the following display appears on their screen:
The balance beam remains on the cash bag side (in 1 . 2 , left) below the horizontal (because the monkeys are too light) and the purse is removed by a greedy grabbing hand (taken outside the picture). Thus, the participant or user knows that he was too early.

Case 3 relates to the case of the subscriber who receives the identification signal at a time after deduction of the minimum time tmin is the earliest closest to the event of the start signal (S => R), i. chronologically immediately before the start signal (S => R). In the example above the participants or the two winners with the address ADD3 and ADD4, because they are both in first place with 01.seconds. Should also be a third place provided, then this would be ADD5 with 0.2 seconds.

For the participant (s) involved in this case, the following is displayed on their screen:
The balance beam takes the horizontal position because the money bag side and the monkeys are equally heavy. Then the monkeys (in the basket) begin to rock with the money bag, indicating to the winner that he has won.

If there is only one winner, then it is easy: The money bag with the profit stated from the beginning is on the bar and belongs to the winner on whose screen the picture is displayed. If the profit must be divided as provided in the example above (if simultaneous participants have been found), then three bags of money corresponding to the split profits are displayed on the bar according to the number of winners (and labeled with the respective amount of money, eg here at REF = 1000,000 euros: two times 400,000 euros and once 400,000 / 2 = 200,000 euros) and except for one remaining money bag, the money bags taken away from one hand (from the image genome men). Thus, the participant knows that he must share the profit. Respectively. Each participant receives the money bag as remaining on the bar he has won.

are from the beginning (according to the established graduation several money sacks (with in their size the monetary value correspondingly), e.g. 1,000,000, 100,000 and 10,000 at a reference value of REF = 1,110,000), then all fall in Case 1 three sacks down and roll out of the picture, in Case 2, all three bags are each taken out of the picture by a greedy hand, and in Case 3 each participant, according to the chronological order something has won his money bag, the others will each removed from one hand. Must be for one Place a profit (to be shared because of time equality), then become the money sacks according to their size changed as indicated above in the example, i. among the equivalent Winners split in equal parts.

It is evident that in all cases Case 1, Case 2 and Case 3. For the Winner will play another song and given the information how they get their money.

emphasis while of the game: Will, as long as the event for generating a start signal (S => R) has not yet occurred is, from a participant (each) issued an identification signal, i. sent to the Senver, then this will be displayed to the participant on the screen. In doing so, the participant recognizes that by all (on the tree Turning) Monkeys, except for one, suspend and only one monkey jumps well visible in the basket, e.g. by moving from branch to branch hopping jump into the basket, e.g. also with other color (for example red instead of black, etc.) is well highlighted. Or the monkey throws one Coin in the basket, etc.

The then the monkey is the user, or participant (by submission his Kennsignals, or by clicking on the relevant Buttons) or animated to throw a coin into the basket, in the expectation that he brings the profit. In this case, the subscriber can as often as required identification signals leave, e.g. each in the weight of 1 euro. That everyone let go Monkey costs, e.g. 1 Euro and can bring the profit. It can e.g. also the use (for example 10 euros instead of 1 euro) for the delivery of a Kennsignals, or letting go of a monkey individually adjustable be made. By elevating the use increases also the relevant participant's group submitted by the participant and statistically improves the chance of winning, taking that use corresponding action signals (characteristic signals) distributed arbitrarily over time can be sent by the participant to the server.

If the identification signal generates a subscriber's sum increased in value (e.g., 10 monkeys, or 10 euros in this example), then, according to several monkeys in a row from the tree in jump the basket to signal the participant's participation, e.g. 10 monkeys for 10 Euro.

The Emphasizing, in each case a participant by triggering his Identification signal a highlighted, jumping on the bar, or a coin Throwing monkeys gets displayed, is always only for the participant generated, which just triggers an action signal (identification signal). The other participants (who currently do not trigger an action signal) received one of the sum of all at a time each triggered characteristic signals corresponding number of jumping on the beam, or in the basket Monkeys with a correspondingly changing inclination of the beam displayed so that they on the respective participation density, whereby at high density through the intensity the color further highlighting is possible.

Becomes the game ends by generating the start signal (S => R), then becomes for all Player in another small window the winning picture (in the Libra swinging monkeys), with the indication that a teammate just won the money bag and the new game continues immediately. Furthermore, a profit statistics is displayed, with date, time and the amount of money won.

For example, to drop an identification signal, there is the "monkey spring" button, which is to be clicked on for this purpose, or this triggering is done by clicking on lotto balls in a lottery drum (as another image), as later 6 will be explained.

The other features (or options) concerning the display of the current state of equilibrium (or state of inequality) between the increasing function S (monkeys) and the reference value REF (money bag) are to be taken from the following game rules, according to which the software running on the server is then designed accordingly.

there is additional for static display for the approach the increasing function S to the reference value REF (via the Inclination of the bar), a supplementary presentation (as an option) provided, how much for the increasing function S (monkeys) is still missing until the weight the money bag (reference REF) by the monkeys, or by the the monkeys in the basket thrown coins is balanced. These another display is defined by a duty cycle, the optical for the explained Example is implemented as follows: For the example described on a monkey circus such that the in the basket jumping monkeys, or their coins, because the basket is getting heavier will lift the beam jerkily, especially because they are in the basket Monkeys are very restless and well visible over the basket edge jump high enough in the basket. That the one by the ones jumping in the basket Monkeys and through the over the constantly kinetic energy pulses generated from above (from the tree) monkeys is the bottom resting on the floor of the swing, which by the weighted down bag is relieved jerky briefly, or lift and then by the weight of the money bag back to the Put on the floor.

there becomes with this periodic movement of the bar with the increasing Weight of the monkeys (i.e., the suspending function S) the time duration in the bar of the swing on the money bag side each Soil lingers, in proportion at the time in which this end of the bar is against the weight of the money bag is raised, with the increasing weight of the monkeys, or their coins thrown into the basket shorter (as duty cycle). Whereby the user (participant) the increasing approach of the residents Function S to the reference value REF via this duty cycle control is shown.

there the transition takes place but not linearly until the start signal (S => REF) is generated, but Upon reaching the above case, Case 3 will be released from the chaotic skidding a more balanced rocking motion (and the player displayed, that he and the winner is). Dito remains in Case 2 of the bars, or the balance beam stand on the money bag side on the ground (sees from it the player, that he the identification signal too early and Case 1 (i.e., the flag has become delivered late and is therefore no longer rated) the bar starts jerking the monkey side (so that the money sacks fall off the board).

In all cases, the time at which the start signal is generated (S => REF) is additionally indicated by a picture symbol and an acoustic signal. For example, for use on a lotto drum shown symbolically ( 6 ) stop the otherwise moving balls.

Example of a screen layout, with preview for another variant with variable reference value: See also 1 and 2 ,

So For example, the swing stands between two trees On one side (for example, on the right) the monkeys sit on the tree in order to enter the jumping basket at one end of the swing. On the up the other side (on the side of the money sack, for example on the left) Tree are on the branches moneybags tied and there are also monkeys who shake the tree. This second tree is intended that the monkeys by shaking one additional Throw money bag on the swing, if necessary, the Reference value REF increase, or, as explained below as a further option in detail, also reduce. Furthermore, the on the money bag side (here e.g. left side) the swinging tree with the monkeys the Possibility, e.g. in the case of Case 2, when the balance bar is on the cash bag side put on the floor for Stops for a few seconds, the bags from the swing down to come across whereupon e.g. the bar then to the side with the Monkey basket moves. That the difference between Case 2 and Case 1 in the display is that in Case 1 the money sacks by the massive overturning of the bar (on the monkey side) high be hurled and roll out of the picture, because in case 1 the game is always ended and in Case 2, however, not (but can be ended).

Further Features: If a player or participant in the basket by clicking the button "monkey spring" Coin inserts (For example, effectively 35 cents from a paid euro) then it will the participant e.g. displayed by a big colorful monkey with a gold piece in the Hand hopping from branch to branch and then either just the gold piece throw into the basket or jump into the basket together with the gold piece.

Rules of the game concerning the previously described monkey game: © Roman Koller (Inventing and applicants)

• • Auf dem Bild ist eine Schaukel mit einem Balken zu sehen, der auf einer Seite mit einem Geldsack beschwert ist, den die Spieler gewinnen können und auf der anderen Seite (der Schaukel) einen Korb aufweist, in den vom Spieler ausgelöst, die erläuterten Affen (bei Abgabe eines Kennsignal) springen können,
• • Der Geldsack wird dann gewonnen, wenn es den Affen gelingt mit dem Geldsack in waagrechter Lage zu schaukeln. Das funktioniert nur dann, wenn genügend Affen im Korb sitzen und das Gewicht des Geldsacks ausgleichen können. Dabei erfolgt der Gewichtsausgleich durch die Münzen, die jeder Teilnehmer seinem Affen mitgibt, wenn er ihn über die Abgabe des Kennsignals in den Korb springen läßt,
• • Wem gehören die Affen ? Die Affen gehören den Spielern. Damit Sie mitspielen können, müssen Sie sich rechtzeitig vorher anmelden. Bei der Anmeldung erhält der Spieler bereits einen Affen geschenkt, der die über Telefon bezahlte Anmeldegebühr von z.B. 40 cent (etc.) in den Korb wirft. Der Korb wird so durch die Teilnahme der Spieler allmählich immer schwerer, auch ohne daß die Spieler bereits aktiv mitspielen müssen, Gewonnen hat der Affe der zeitlich am nächsten vor der Mindestzeit tmin desjenigen Affen liegt, dessen Münzgewicht (entspricht der aufsummierten Summe S) den Ausschlag gibt, daß der Geldsack über die Schaukel so weit angehoben wird, daß sich die Affen mit dem Geldsack waagrecht schaukeln können. Der Gewinn gehört dem Spieler, dem der Affe der den Geldsack gewonnen hat gehört. Dabei ist es völlig egal, ob der betreffende Affe der bei der Anmeldung erhaltene Affe ist, oder ein während des Spiels durch das Kennsignal ausgelöster Affe. Hinweis: Weiters ist noch vorgesehen unmittelbar nach Abgabe eines Kennsignals die wiederholte Abgabe kurzzeitig um die Zeit tw zu blockieren, um eine gleichberechtigte Aufteilung der in den Server eingehenden Aktionssignale (Kennsignale) zu erhalten. Siehe dazu später zu 4a. Für die praktische Realisierung von tw bestehen die beiden Möglichkeiten, entweder bei Betätigen des betreffenden Button zur Abgabe des Kennsignals das Kennsignal zwar abzugeben, jedoch die Wirkung (in Bezug auf die Darstellung der Affen um tw am Bildschirm) verzögert anzuzeigen, oder den das Kennsignal betreffenden Affen synchron mit dem abgegebenen Kennsignal darzustellen, wobei dann der Spieler die Wirkung im Spiel um tw verzögert (zu seinem Affen) dargestellt bekommt.
• • D.h. wenn ein Spieler sich für das Spiel anmeldet, dann kann er theoretisch auch gewinnen, ohne daß er überhaupt spielen muß, da ihm bei der Anmeldung bereits ein Affe zugewiesen wurde. Solche Spieler haben so aber nur sehr geringe Chancen. Weil die Gewinnchance erst eintritt, kurz bevor sich die Affen schaukeln können, d.h. wenn genügend Münzschwere Affen im Korb sitzen oder Münzen im Korb liegen, um das Gewicht des Geldsackes zu heben. Das ist bereits im Ansatz erkennbar, wenn sich der Geldsack durch die einsetzende Schaukelbewegung immer kurzzeitig vom Boden abhebt.
• • Wenn ein Spieler spielen will muß er sich hiefür eigens einen besonders schlauen Affen besorgen. Ein jeder dieser Amen will vom Spieler z.B. 1 Euro damit er für den Spieler in den Korb springt. Dabei hören diese Affen auf das Kommando des Spielers. Er kann sie auf Knopfdruck (Button anklicken) vom Baum in den Korb springen lassen, damit dieser Affe derjenige ist, der (wenn der Spieler Glück hat), den auf die im Geldsack sich befindende Summe fehlenden Euro in den Korb wirft, damit das Gleichgewicht hergestellt wird und die Affen mit dem Geldsack schaukeln können (wobei dieser Affe um die Zeit tmin mindestens vorher da sein muß, wenn nachfolgend ein anderer Spieler, bzw. Affe des Spielers, das Gleichgewicht mit S=>REF herstellt).
• • Es ist im Prinzip egal, ob ein Affe in den Korb springt, oder er auch nur die Münze hinein wirft, beides hat die gleiche Wirkung.

To better understand the implementation (integration) of the procedure into a practical game If you can, you have to give a brief description of the rules of the game. These rules of the game are to be understood as a supplement to the description in order to better emphasize the universal applicability of the method. To explain the rules of the game, so far as necessary, their technical realization is indicated. Subsequent to these game rules then essential technical developments of the invention are explained.

• • The picture shows a swing with a bar weighted on one side with a money bag that the players can win and on the other side (the swing) has a basket, in which triggered by the player, the explained monkeys can jump (when an identification signal is issued),
• • The money bag is won if the monkeys manage to swing the money bag in a horizontal position. This only works if enough monkeys sit in the basket and can balance the weight of the money sack. In this case, the weight is compensated by the coins that each participant gives his monkey, if he lets him jump over the delivery of the identification signal in the basket,
• • Who owns the monkeys? The monkeys belong to the players. To be able to play, you must register in good time in advance. When registering, the player is already given a monkey, who throws the paid via telephone application fee of eg 40 cents (etc.) in the basket. The basket is thus gradually becoming more difficult due to the participation of the players, even without the players having to play actively, The monkey has won the time closest to the minimum time tmin of that monkey whose coin weight (equivalent to the total sum S) the rash gives that the money bag is lifted over the swing so far that the monkeys can swing with the money bag horizontally. The prize belongs to the player who owns the monkey who has won the money bag. It does not matter whether the monkey in question is the monkey received at registration, or a monkey triggered during the game by the identification signal. Note: Furthermore, it is also intended to block the repeated delivery briefly by the time tw immediately after delivery of an identification signal, in order to obtain an equal distribution of the action signals (characteristic signals) entering the server. See later 4a , For the practical realization of tw, there are two possibilities, either to release the identification signal when the relevant button is pressed to output the identification signal, but to delay the effect (in relation to the representation of the monkeys by tw on the screen) or to concern the identification signal Representing monkeys in sync with the emitted characteristic signal, in which case the player gets the effect in the game delayed by tw (to his monkey).
• • That means that if a player signs up for the game, then theoretically he can win without having to play at all, as he has already been assigned a monkey when registering. Such players have but very little chance. Because the chance of winning occurs only shortly before the monkeys can swing, ie when there are enough monkeys in the basket or coins in the basket to lift the weight of the money bag. This is already recognizable in the approach, when the money bag always stands out from the ground for a short time due to the onset of rocking motion.
• • If a player wants to play, he has to get a particularly clever monkey for this purpose. Each of these Amen wants the player eg 1 Euro so he jumps for the player in the basket. These monkeys listen to the command of the player. He can let them jump from the tree into the basket at the touch of a button (click on the button), so that this monkey is the one who (if the player is lucky) throws the missing sum into the money bag into the basket, thus the balance and the monkeys can swing with the money bag (this monkey must be at least before the time tmin, if subsequently another player, or monkey of the player, the balance with S => REF produces).
• • In principle, it does not matter if a monkey jumps into the basket, or if he just throws the coin in, both have the same effect.

Options for one variable reference value (see also later):

dissatisfied Monkeys: As is generally known from the zoo visit, monkeys are very idiosyncratic. Our monkeys are no exception. The most important in the life of a monkey is action: No action no fun. If it is at the end of the beam the monkey basket gets too quiet because of the monkeys on this page coins (ie the public is not particularly risk-averse), get these monkeys from their friends on the tree on the other Side of the beam support.

In the process, some monkeys playing high above the money sack on a tree jump down and push the money sack off the beam, while others throw down a smaller sack of money that remains lying on the beam. This means that the reference value has been reduced by a value which ensures that the value of the increasing function S (via the monster monkeys) formed on the monkey basket side without further Er elevation is now closer to the new reference value REF, whereby the unrest of monkeys jumping around in the monkey basket of the beam begins to move much more violent in the manner described, which of course increases the interest of the players now play along, so as not to miss the chance of winning.

Subsequently, the reference value REF is increased again, so that the profit is higher, but there is a real chance of winning even with the reduced reference value REF. This is controlled by the probability dip described later. See also to 3 ,

The Reduction of the reference value REF is only performed if the access of the persons participating in the game to an important one Time (main playing time) decreases. there this is automatically done so that when the increase subsides the formed by the votes issued by the players Kennsignale Sum of the increasing function S, the reference value REF thus reduced he will in the vicinity of the current value of the sum S. That the one to achieve Profit is reduced to the new reference value REF. Where, there The operator of the game must also earn the game at one Equilibrium S => REF, the actual Paid amount not S, but (1 + k) · S is 1 + k as a profit factor.

The Near, in which the reference value REF is reduced in relation to the sum S, also calculated according to the respectively determined frequency the received characteristic signals, or the increase in time of the sum S. It is useful gradually (incremental), e.g. in a first step REF on the Value REF = 1.1 S and then over a certain period of time to wait for the reaction of the players. Is the rise of S always still too low, then the reference value REF is further reduced, e.g. to the value REF = 1.05 S again over a certain period of time to wait for the reaction of the players. This approach with a Gradual reduction of REF takes place until those involved Player increasingly issued identification signals. If e.g. at REF = 1.04 S increasingly receive identification signals, i. the sum S is sufficient again increases, then the reference value REF is statically maintained until the game is decided by reaching the condition S => REF or the game becomes despite reaching the condition S => REF This is then followed by the probability consecration described later is decided.

That the REF value in proximity the sum S is given to the player by the previously explained method displayed, over the test ratio and the severity, and also amplitude excursion, if necessary also by a crash sound with the bar end is moved with the money bag up and down. there For example, when the value of S comes close to REF, e.g. also the money bag on the bar (depending on the approach to S) more or less jump up and down violently, etc., to give players the degree of proximity (from S) to the reference value REF, i. to display the final.

• – Um mit einer einfach zu definierenden mathematischen Wahrscheinlichkeit z.B. von 50:50 (es sind auch beliebige andere Verhältnisse möglich) die Möglichkeit vorzusehen, daß kein Spieler eine Runde zu dem aktuellen Referenzwert REF gewinnt, ist eine automatische Wahrscheinlichkeitsweiche (als optionale Erweiterung) vorgesehen, bei der für eine bestimmte exakte mathematische Wahrscheinlichkeit (die in der Software auch einfache nachprüfbar ist) das im Spiel zwar ein dem aktuellen Referenzwert REF entsprechendes Startsignal S=>REF erzeugt wird (für eine erste Variante der Wahrscheinlichkeitsweiche), das Spiel jedoch nicht beendet wird und die Summe S (als den Affen entsprechendes Münzgewicht) stehen gelassen wird. D.h. es gibt keinen Gewinner, dafür bleibt die Summe S stehen, so daß zu Beginn des neuen Spiels der Referenzwert REF wieder automatisch erhöht werden kann und auf diese Weise, je nachdem wie das Spiel durch Zufall verläuft, sich der Referenzwert REF über einen längeren Zeitraum in der Größenordnung von Millionen wachsen kann. Sei dieser Art der Realisierung der Wahrscheinlichkeitsweiche (erste Variante) werden wesentlich mehr Aktionssignale für die Summierung der Summe 3 verwendet, als die Teilnehmer abgeben (und intern im Server oder einer externen Peripherie des Servers erzeugt). Es besteht daher ein Überschuß an Aktionssignalen.
• – Eine zweite Variante der Realisierung einer automatischen Wahrscheinlichkeitsweiche ist, daß durch eine statistische Wahrscheinlichkeit festgelegt wird, ob durch ein von den Teilnehmern abgegebenes Aktionssignal als Kennsignal gewertet wird oder nicht, d.h. bei dieser Art der Realisierung der Wahrscheinlichkeitsweiche (zweite Variante) werden die an den Server abgegebenen Aktionssignale gefiltert.

Of course, one could simply increase the reference value REF step by step again so as not to let it come to a profit, but then one would already be in the vicinity of a manipulation, however, a method is provided in further development, so that the increase of the Reference value is decided solely by the participants on probability and chance.

• In order to provide for the possibility of no player winning a round to the current reference value REF with an easily defined mathematical probability, eg of 50:50 (any other ratios are possible as well), an automatic probability diverter (as an optional extension) is provided, where, for a certain exact mathematical probability (which is also easy to verify in the software), a start signal S => REF corresponding to the current reference value REF is generated in the game (for a first variant of the probability switch), but the game is not ended and the sum S (coin denomination corresponding to the monkey) is allowed to stand. That is, there is no winner, but the sum S remains, so that at the beginning of the new game, the reference value REF can be automatically increased again and in this way, depending on how the game runs by chance, the reference value REF over a longer period can grow on the order of millions. If this type of realization of the probability diplexer (first variant), substantially more action signals are used for the summation of the sum 3 than the participants deliver (and generated internally in the server or an external periphery of the server). There is therefore an excess of action signals.
• - A second variant of the realization of an automatic probability crossover is that is determined by a statistical probability, whether or not evaluated by an participants of the action signal as Kennsignal signal, ie in this type of realization of the probability crossover (second variant) to the Server submitted action signals filtered.

In the first variant (excess of action signals) the probability crossover becomes so real s, that in the range of REF = (1 + x) · S for x << 1, for sufficiently large k for (1 + k) · S as amount to be paid with 1 + k as a gain factor, from a certain value in the reduction of x for (1 + x) · S on the cash receipt of a part dS, for the summation of S is omitted, that is calculated with a lower profit. This proportion dS corresponds to a certain number n of characteristic signals that are not generated by the participants but internally. The procedure is that a certain ratio of identification signals is defined, which are submitted by the participants of the game and which are generated internally in the server, this ratio is defined according to a defined probability and the votes issued by the players and the identification signals from the server generated characteristic signals are homogeneously nested respectively to the game for the formation of the sum S submitted.

Becomes for example the first variant (excess of action signals) probability probability of 50:50 (= 1: 1) defines, then becomes to each characteristic signal received from a player generated by the server yet another identification signal, the time is placed so that it statistically speaking, in the hut of the participants incoming action signals (identification signals) is located. It will be during the Delivery of the internal identification signal generated by the server on or further Arriving by the participants respectively arriving characteristic signal delayed as long as until it is processed by the server.

Becomes e.g. a probability of 2: 1 for the incoming characteristic signals defined, then only after every second sent by the players Identification signals generated by the server, or for a probability of 1: 2 will be for each of a player respectively incoming characteristic two internal Kennsignale generated by the server, etc. It must in the profit calculation (1 + k) · S, or for to be paid in each case to an identification signal from the players Amount considered as each be that of the Server generated identification signals do not bring money into the cash register, accordingly careful must the Threshold x are defined, where in the range of REF = (1 + x) · S for x << 1 the internal generation of the server generated identification signals is turned on when by the probability switch Use is made. It is evident that the values of k and x depend on the defined probability with which the game wins without a winner (and the amount received as reference REF bunkered to be defined), since the number of each paid by the players each characteristic signal identification signals generated by the server (which are not paid) depends on this defined probability. That means by This first variant of the probability curve must be an occurring Lack of money in relation to the increasing sum S corresponding paid-up amounts and the reference value to be obtained as a "money bag" REF considered become.

at the second variant for the realization of the (optional) probability switch The procedure is that the Sum of the over the summands dS given by the participants summed sum S is formed so that alternately result in even and odd values of the sum S. If e.g. dS as an odd integer. e.g. 1 or 3 or 5, etc. chosen then every other number of the sum (as a corresponding multiple from dS) be an even number and the odd between them (1, 2, 3, 4, 5, ... or 3, 6, 9, 12, 15 ... 5, 10, 15, 20, 25, ... Etc.).

The exam whether S is an even number, or an odd number the signal used to decide if the random signal is received (S => REF) the profit is paid out (e.g., if S is even) or the reference value REF is held and played (e.g., if S is odd). It could the assignment of the exam (even / odd) as well as vice versa.

• – Da bei dieser zweiten Variante der Wahrscheinlichkeitsweiche ein Mangel an Aktionssignalen (Kennsignale) auftritt, wird für den Fall, daß die Aktionssignale mit einem eingezahlten Geldwert verbunden sind, ein Überschuß bestehen, wenn der Geldsack gewonnen wird, da zwar der Geldwert zu den Aktionssignalen (Kennsignalen) abgebucht wird, jedoch die Aktionssignale entsprechend diesem Geldwert nicht aufsummiert werden, d.h. bei der Bildung der Summe S (als Gegengewicht zum Referenzwert REF, bzw. bereit gestellten Geldsack) nicht mit gewogen werden (nicht berücksichtigt werden). Das heißt, geht das Spiel entsprechend der durch die Wahrscheinlichkeitsweiche herbeigeführten Entscheidung weiter, dann kann dieser Überschuß an Geld dazu verwendet werden, um den Referenzwert REF bei gleichzeitiger entsprechender Erhöhung des Summenwertes S (entsprechend dem tatsächlich vorhandenen Geldwert) zu erhöhen. Wird das Spiel beendet, dann kann der überschüssige Geldbetrag auch dazu verwendet werden, um bei der nächsten Ziehung mit der ersten Variante der Wahrscheinlichkeitsweiche die intern vom Server erzeugten Aktionssignale zu finanzieren (welche dem Server eine Wahrscheinlichkeit zum internen Gewinnen, d.h. zum Weiterspielen ermöglichen).

Furthermore, this second variant can also be used to realize a different ratio, eg 25:75, etc., other than a statistical probability of 50:50 (since an even number follows an odd number), if the number of even or odd (depending on the change in the ratio) values of the sum S are divided accordingly, for example, as the output of the switching signal after 7 to obtain, according to which the probability is controlled: Win or continue playing or as will be explained in more detail below to control a multiplexer, which alternately divides the use of a player on the reference value REF and the sum value S, or only to the sum value S ,

• Since there is a lack of action signals (characteristic signals) in this second variant of the probability diplexer, if the action signals are associated with a paid-in monetary value, there will be an excess when the money bag is won, since the monetary value for the action signals ( Identification signals) is debited, however, the action signals corresponding to this monetary value are not added up, that is to say in the formation of the sum S (as a counterweight to the reference value REF, or provided money bag) are not weighed (not taken into account). That is, the game goes ent In accordance with the decision made by the probability switch, this excess of money can then be used to increase the reference value REF, with a corresponding increase in the sum value S (corresponding to the actually existing monetary value). If the game is ended, then the excess amount of money may also be used to finance the internal generated by the server action signals (which allow the server a probability for internal winning, ie to continue playing) in the next draw with the first variant of the probability.

The Reduction of the reference value REF, if necessary also again increase (with simultaneous increase of the sum value S) and the use the explained Enable probability switch it, the game constantly in the interesting range, that is the limit of REF = (1 + x) · S to run, with x as to be overcome by the players Zünglein the Libra, as with the lottery there is already one game for each game Winner, or even after a hundred games. Decided this will be over the probability dip with a fixed probability, but in turn by the players on the incoming Kennsignale is controlled without a Manipulation possible is.

Becomes the gain of an identification signal (next before tmin relative to REF => S) decided that a player has submitted, then the player has won, gets the equivalent of the reference value REF paid out and the sum S starts again with or from one of the previous ones Play still left remained credit.

• – Eine weitere gute Methode die vorgegebene statistische Wahrscheinlichkeit der Wahrscheinlichkeitsweiche zu steuern, ist beide Weichen, d.h. die erste Variante und die zweite Variante alternierend hintereinander oder auch praktisch gleichzeitig zu verwenden, und zwischen Soll- und Haben zu steuern, und zwar so, daß der Verlust, den die Wahrscheinlichkeitsweiche der ersten Variante erzeugt, durch den zusätzlichen Überschuß den die Wahrscheinlichkeitsweiche der zweiten Variante erzeugt ausgeglichen wird.

If the win is decided by an identification signal (next to tmin relative to REF => S) generated by the server internally (corresponding to the first variant of the probability dip), then none of the players has won, the equivalent of the reference value REF remains for the the next game is stored, and from the sum S, the proportion dS is subtracted, which is the sum in monetary value of the characteristic signals generated by the server when reaching x for REF = (1 + x) · S for x << 1, ie when a certain Approximation x of the sum S to the REF is missing (since no money is received for the identification signals generated internally by the server). After formation of the difference S - dS = S, the remaining sum S is obtained as the equivalent to the reference value REF, ie dS must first be paid back by the player by issuing new Kennsignale, so that the balance is restored or it will be the missing amount dS financed at the given moment by a probability switch of the second variant, ie by the amounts that are indeed paid to the action signals emitted by the participants, the associated action signals are not included in the sum S, ie not weighed.

• - Another good method to control the predetermined statistical probability of the probability crossover, both ways, ie the first variant and the second variant alternately in a row or virtually simultaneously to use, and to control between debit and credit, in such a way that the Loss generated by the probability dip of the first variant is compensated by the additional excess generated by the probability dip of the second variant.

Note: Another big one Difference between the two variants for the realization of the probability curve is that the first variant the game by the additional summation S of the internally generated by the server (but not covered by real monetary value) Action signals, i. by the steepening of the rise of the function S the game is accelerated, i. the approximation to S> = REF is accelerated. Conversely, on the other hand in the second variant, the game through the filtered, or attenuated additional Summation of S, i. by flattening the rise of function S the game slows down. These aspects are by computer program still considered.

there If necessary, the reference value REF can also be set a little higher in each case before the game starts, and then when x reaches REF = (1 + x) · S for x << 1 the probability crossover through internal generation of the reference signals switches on, as before or if the reference value was raised too high before the game was played, can be reduced again by the method described. On This wise the game will be constantly kept going and it constantly animated teammates.

option Telephone service: For a small extra cash may be every player from the "zoo direction" (= computer voice prompt) be notified when the monkeys are about to arrive the rocking movement (i.e., the rising Function S has already approximated the reference value).

As the reader can easily see, it makes sense to set an example for the rules of the game to better understand the meaning and purpose of the technical features of the process.

Also if it looks simple at first glance. Considering all security risks - and manipulation possibilities Things get a bit complex. Sure, that's through introduction a minimum time tmin, within which the time rating the number of subscriber incoming to the server is no longer the possibility of manipulation It is certainly avoided by computer programs to loot the profits. The same applies the generation of numerous other parameters according to the same random principle in each previous games, then in the subsequent game are used.

there aggressive participants always harm themselves, since they do have one Deposit amount of money, and maybe trigger the start signal (S => R), the Profit, however, another, unpredictable participants cashed.

When Another alternative may be the minimum time Tmin through the computer program can be made controllable, e.g. detected will be the individual participant or groups of participants about their Calculator overly many Send identification signals compressed in time, the minimum time tmin in a prolonged Value is given to attacks by program controlled computers to avoid. It is then easy between different Values of the minimum time tmin, previously by chance as well were detected, switched. Or as described below In such a case, the reference value REF (profit) will also be automatic through the program higher can be set (monkeys throw more money sacks on the swing) to one Attack by software-controlled foreign server to repel the automatically generated action signals (identification signals) in compressed Send form to the server.

Other variations for use a dynamically changed one Referenzwetres:

In this option, it is provided that the reference value REF, as already mentioned, for this method variant is not static, but is controlled by the computer program, made movable, not only down, but also upwards. In particular, according to a trend of triangles with a constant tendency rising, similar to stock prices and how to 3 will be explained later.

A change the reference value REF is upward, e.g. for many reasons. Of the first reason has already been addressed, that is if individual participants with software support through their computers the server with temporally compressed input bunched up in heaps "Bombard" identification signals, i. the profit absolutely want to force. Will this be (statistically) automatic recognized, then that causes Program a corresponding increase of the reference value REF, so that the Start signal S => REF in the time interval certainly not generated by the bombing, but only to one later Time. For that was by the progressive increase of the bombardment increasing function S (with the incoming payments) Also the money weight (on the monkey side) neatly increased.

One another reason for a program controlled increase of the reference value REF, that the game is started with a relatively low reference value REF and many logins in the server to (for example, from the next Day) to reserve a game, giving each new player a monkey, or a corresponding Teilnehmerumsummanden to form the rising Function S introduces. Since this monkey as a participant sum each belongs to a player, could this participant sum, or monkey, the money bag already win, before the actual game at all still started. Therefore, the program then causes a corresponding increase of the reference value REF, so that the Start signal S => REFst is generated in the game, i. by the incoming identification signals, i. through the appropriately liberated coin-heavy monkeys of the participants is decided first. In this case, the variant is provided that it before the actual beginning of the game is a registration phase, in the the participants deposit and before the match on basis the amounts paid in, which give the current sum S, the reference value REF for the start of the game (slightly higher as S) is set automatically.

One other reason the reference value through the program via a To increase automatic recognition results when the reference value for reasons the stagnation of the game was briefly lowered and the Money bag not robbed yet (recovered) (i.e., the start signal S => REF to the decremented reference value not yet created). This has already been explained (cf. also correction of dS).

Another option, lower or increase the reference value at random of a multiplexer control:

The change of the reference value REF can also be used with the inclusion of done with the server networked players. This is done by one over a random number generator, e.g. through the already explained probability switch controlled multiplexer, where the profit adjusted input of the incoming Teilnehmerummums, which the accumulated coin weight the monkey (as increasing function S) is attributed, also to the current reference value REF is added to change this value.

In In both examples, the probability crossover is by the second Realized variant, wherein the output Q according to the evaluation, whether the sum S is even-numbered or odd-numbered; Indeed so that yourself the assignment according to the prinizip of a two divisor (toggle flip Flops) constantly changes.

First An odd-numbered value of S corresponds to a Q = 0 and an even-numbered one Value of S a Q = 1, then an odd-numbered one Value of S a Q = 1 (hold state) and an even value from S to a Q = 0. This behavior is handled by a state machine (also implemented in software, etc.). In Example 2, only the One place (without consideration the number after the comma used to make the statement even or to make odd. The assessed body follows the input. For 10 cents would then for a little further to the right this review. Respectively. at Multiples of the input value (e.g., 30 cents) are judged whether the value of S is even or not, S is a second value stored or calculated, which would result if the input value is not 30 cents, but 30/30 cents, so 10 cent cheat.

In Example 1 is the input value of 1 euro each on both the Sum S, as also netted on the reference value REF, with the Result that is on the difference of S-REF nothing changed, which is why the balance bars the angular position α too not changed. That it still lacks 1 Euro so that S => REF.

In Line 1 and line 4 is the output of the probability crossover Q on log. 0, i. it will be the input of 1 euro exclusively only to the previous total value of 998 euros (taken from previous line and not shown) adds up to 999 euros. In difference to lines 2 and 3, where the output of the probability dip Q on log. 1 stands, which is why the input of 1 euro on both the sum S, as well as on the reference value REF is calculated, thus the Difference of 1 euro between the sum S and the reference value REF not changed. That that exclusively on the sum S summed input of 1 Euro gives the profit of 1002 euros, but for another participant leading the time tmin and not the participant who paid the input from line 4. Except, the time would be tmin set to the value zero, then the participant of the input would be from row 4 at the same time the winner of the 1002 euro.

Example 1: (The input is added to both the value S and the value REF):

Example 2: (The input equals to the value S and to the value REF added):

In Example 2 is the input value of 1 euro in half to the sum S, and to other half calculated on the reference value REF, with the result that is the difference of S-REF also does not change, which is why the balance bar the angular position α also not changed. That it still lacks 1 Euro so that S => REF.

In Line 1 and line 4 is the output of the probability crossover Q on log. 0, i. it will be the input of 1 euro exclusively only to the previous total value of 998 euros (taken from previous line and not shown) adds up to 999 euros. In difference to lines 2 and 3, where the output of the probability dip Q on log. 1, which is why the input of 1 euro in half on the Sum S, and the other half is offset to the reference value REF, thus the difference of 1 euro between the sum S and the reference value REF is not changed. Since on the value S only half of the Input is summed, thus increasing the deposit and thus is the Cash on line 4 here by 1 euro higher than the payout as a profit Reference value REF. In the course of the cycles this difference substantially increased.

There the input value (here 1 euro) for both of the above examples are already profit-adjusted, i. of the participants pays a much higher Amount, e.g. 1.50 euros, in the second case we obtain an excess, e.g. can be used to generate action signals generated internally by the server to finance (which are evaluated as own characteristic signals) and to realize a probability dip of the first variant, which has the advantage that the because of the steepening of the function of the sum S, namely in direct amplification of Number of action signals (or characteristic signals) arriving in the server the participant by a probability factor corresponding Factor, thus in reinforcement the rise of S, the game in relation to the approach of S accelerates to the reference value REF.

ever after application can the input values from the participants to each delivered action signal (Kennsignal) or be paid in advance, such. in a lottery drawing. In a lottery draw, it is appropriate the Weighting dS corresponding to the delivered action signals amounts proportional to when filling of the lottery ticket deposited amounts to the participants. Not all participants participate in the draw, then becomes internal for the Calculation S => REF the reference value is proportional reduced the current number of participants.

For example, in the case of m lottery ticket holders, only p = 80% of the draw will be played, whereby the amount BZ will be available for the payout in total. Thus, the weight attributed to an action signal becomes the summation of dS = BZ / m and the reference value REF = p · BZ = 0.8 · BZ. If the number of subscribers continues to decrease or increase, the reference value is corrected in such a way that the following applies to the total sum S and to the generation of the start signal: S = {dS = {BZ / m = p · BZ ,

Another option:

For this For example, options are still available to every player on the WEB site two additional ones Buttons provided to "manipulate" the profit (without actually causing it to be controlled) can): "increase profit" and "reduce profit". That satisfies the Purpose that the Reference value, so to speak, via a democratic voting of all players can be controlled directly.

For example, if one of these two buttons is clicked to "increase profit" and "reduce profit", the "monkey spring" corresponding function in addition to the inkre mental change of the reference value is also carried out with what is visually displayed to the user.

The both functions "profit zoom in "and" reduce profit "are for all participants each sign according to the ratio of each participant incoming signals REFplus and REFminus are summed up, causing the all participants Reference value REF is changed accordingly.

Thus, the reference value REF results from the value REF = REF +/- ref.
and ref from ref =
= (REF · K) · (sum REFplus + sum REFminus) / number of identification signal respectively.

The Number of identification signals corresponds to the sum of all in the evaluation time interval in each case in the server respectively received characteristic signals. That one certain percentage of REF (that is REF · K) is in proportion to the Participants, each one issued an identification signal and also one change the reference REF (the value of the purse), split and REF Corrected accordingly. This procedure is followed in this formula, that only those participants a signal to change the value of the purse (REF) can deliver which simultaneously emit an identification signal. This will achieve that if the REF value is too big, a few participants by jumping their monkeys (e.g. on the right side) to increase the sum S, at the same time the money bag can facilitate around in the vicinity come from S = REF (so that the sum exceeds the reference value). In this case, the factor K for the expression REF · K as Function of the current deviation from S and REF defined and over a Table can be read out.

Furthermore, can e.g. also, dependent of the deviation between S and REF only one direction at a time, into which the reference value REF changed can be provided, with appropriate emphasis / darkening the buttons "Profit zoom in "and" reduce profit ".

The both buttons "Profit zoom in "and" increase profit "are for example on the side under the beam end, where the money bag is shown is arranged and with "hem shake "(so the bags on the bar). On the other side, or at the other Balkenende, where the monkey basket is shown, then the button "monkey spring" is housed, the also operated but without changing the reference value, e.g. if one or both of the buttons "Profit diminish "and" increase profit "is darkened (i.e., turned off). The shutdown / activation of the possibility to change the reference value REF can e.g. again controlled by a probability dip become.

For the example of replicating a lottery draw is provided that the server during the game continuously assigns the participants numbers, as they have been ticked on the lottery ticket (eg via a WEB page) by the participants before. At the beginning of the game, all participants are assigned a number that can be repeated over several participants. During the game, the server program ensures that, on the one hand, all possible numbers and, on the other hand, as many as possible of each number (distributed among the participants) are involved. On this example we too 6 received later.

at the application for A lottery draw is also the opportunity to play with the game explained in the beginning to combine, i. that only against payment a monkey on the (here rake side) can jump on the bars, either in addition to Lottery draw players to make a profit separately from the lottery win can (The reference value to be obtained by these players will then be e.g. displayed separately in a separate display) or the players can play for free, or even when signing up the game the lottery numbers on payment a fee have to be ticked and again when playing games fees be paid.

at a free game is one of the number of players (Participant) controlled time tw provided after submission of a Identification signal a repeated delivery for this participant respectively as long as the time tw expires. The more participants participate in the game, the bigger it gets, so few participants can not block the others.

The drawing made via the Internet or via an active TV program can be announced, for example, for a specific time. In this example, on the left side of the bar is the money bag with the standby lottery prize as the reference value REF, eg 1000,000 euros of 10,000,000 over the Internet sold lottery tickets a 20 cents. Thus, for each game 1000,000 euros remains the operator.

At the start of the game (at a certain time), monkeys (or coins thrown by the monkeys into a basket, etc.) must therefore be present on the opposite side or on the right side of the bar for a value of just under € 1,000,000. This condition is achieved by creating a monkey horde at the beginning of the game via the server, which jumps onto the bar, or into the basket, around the equation
REF = S + x, in this example 1000,000 = 1000,000 - x to match.
with x = n · ds

dS

... das ist das Gewicht in Euro, der einem von einem Teilnehmer losgelassenen Affen entspricht;

n

... ist die Anzahl der von den Teilnehmern abgegebenen Kennsignale um den Wert von S soweit zu erhöhen, damit S=>REF wird.

The following values must be defined at the beginning of the game:

dS

... that is the weight in euros that corresponds to a monkey released by a participant;

n

... is the number of characteristic signals emitted by the participants to increase the value of S so that S => REF.

Consequently dS dependent n is determined by the program by how many characteristic signals the state S => REF (the number n) of compensation takes place.

Example:

At the beginning of the game, 5000 participants registered. It is calculated that, for example, with n = 10,000 identification signals the game should be decided by reaching S => REF, REF = 1000,000 euros. REF = S + x REF = n · ds + x

Becomes Played free, then x is freely selectable, e.g. x = 900,000, which immediately before the game begins with monkeys triggered internally by the server (shown in the picture) is generated as output value.

100000 = 10,000 x 10, where for each identification signal the summand TNW = 10 euros on the increasing function S (starting from x = 900,000) is added up.

variant TV: If the game is played on TV (for example with a through the Server controlled animated movie in FLASH), then the triggering of the Monkeys e.g. with a telephone by keystrokes or even by an acoustic release via speech recognition (e.g., "GO", etc.). It can as long as the time tw the actuation lock and no audio signal can be audible in the handset and in an attempt just sound a piper when the time tw has expired, music will sound again until you press to trigger the identification signal (a monkey).

The Presentation on the WES side opposite the TV game has the advantage that the individually triggered Monkeys especially highlighted to each player (regardless of the other players) can be represented.

After each delivery of an identification signal to the player from the server either a new number or assigned, the server makes so that of each (possible) lottery number always the same number of participants are distributed, or the player can each of a group of numbers select one again (see 6 ).

Becomes the start signal by S => REF fires then those players or their action signals (characteristic signals) won, which after deduction of tmin are closest to the triggering time, if (as variant / option) further criteria are not defined are such as the position drawn in a previous draw the number drawn within a series of numbers, as later is explained in more detail.

• • Werden gleichzeitig unterschiedliche Zahlen von mehreren Spielern durch gleichzeitig in den Server eingehende Aktionssignale (Kennsignale) gezogen, dann werden diese überhaupt nicht bewertet und dafür die Zahl eines der Definition für die zeitliche Reihung entsprechenden nachfolgenden Aktionssignals als gezogen bewertet, welche entweder zum betreffenden Zeitpunkt nur ein Kennsignal aufweist oder auch mehrere Kennsignale, jedoch mit der gleichen Zahl (als Zuordnung).

However, the following is taken into account in order to exclude a multiple interpretation of different numbers for the same action signal (or identification signal):

• • If different numbers are simultaneously drawn from several players by action signals (identification signals) coming into the server at the same time, they are not evaluated at all and instead the number of a subsequent action signal corresponding to the definition for the time series is judged to have been drawn either only at the respective time has a characteristic signal or even several characteristic signals, but with the same number (as assignment).

In each case, so many times after the series arriving characteristic signals are evaluated, as they are as An Number of Lotto numbers are required, with repeating digits in the number sequence are excluded from the outset, since already drawn digits are no longer assigned to the participants in the new draw.

Option: Another option of this lottery is that each participant only or additionally also plays with the numbers typed by him when he triggered as Identification signal in each case (by clicking) can send. So increases for each Teammates the probability that at least some of his numbers is under the drawn at the end of the game.

Evaluation and Timing:

For the timekeeping the time span between characteristic signal and as a random event (S => REF) resulting Start signal are a variety of quasi-parallel time measurements intended. As already explained, is subtracted from the measured difference, the value of tmin, and negative results are not considered.

Furthermore is provided in training, as a random event (S => REF) in the server resulting Start signal also to the terminals of all subscribers, and in the terminals of each subscriber the time measurement between a given action signal (identification signal) and the possibly (eventually) entering start signal measure, since, after a certain number of characteristic signals, the always overwritten in a buffer memory be, it does not matter if no readings come about (da the start signal within the maximum measuring time still provided did not occur). It is in each case in the terminal of the subscriber a buffer memory (FIFO, first in first out) is provided, the stores as many action signals (identification signals) of the subscriber between as the participant action signals within the maximum Zeittdauer from tmin can (limited by tw).

• – Da es hier nur darum geht, über die Zeitdifferenzen der in den Server eintreffenden Aktionssignale (Kennsignale) eine Zufallsauswahl ihrer Absender zu treffen, wären Verfälschungen durch technisch bedingte Zeitverschiebungen im Prinizip belanglos, jedoch ist eine (als Option vorgesehene) Korrektur bzw. Berücksichtigung dieser Zeitverschiebungen insofern interessant, wenn an mehreren unterschiedlichen Stellen gemessen wird (Server, Protokollstation, Teilnehmer), daß einigermaßen gleiche Ergebnisse erhalten werden, um gegebenenfalls Manipulationen erkennen zu können.

Since the server can not send the start signal to all subscribers at the same time (as real-time data information), the participants are also sent correction times which compensate for these time differences, so that the results determined in the participants' computers match those measured in the server within the scheduled time Resolution match.

• - Since this is only about the time differences of the incoming into the server action signals (identification signals) to make a random selection of their sender, distortions due to technical time shifts in the prinizip would be irrelevant, but is a (provided as an option) correction or consideration of these Time shifts are interesting insofar as it is measured at several different points (server, protocol station, subscribers) that reasonably similar results are obtained in order to be able to detect manipulations if necessary.

There can not be predicted when by chance event (S => REF) resulting start signal enters, must for the time measurement in the server a certain number of quasi-parallel time measurements be provided. It is sufficient for the determination of a simple Sweepstakes so many parallel running measurements than in turn Winners are to be determined. Here are the different Processing times by the software of quasi-parallel running Timing operations as well considered be, or e.g. an external circuit (DSP, etc.) support this.

The Timing is similar like a LIFO, last in - first out storage, being for a number of z time measurements to be taken almost simultaneously for the each last arrived z characteristic signals of the sequence z0 ... zn, with zn being the youngest, or z0 as the oldest Signal, upon arrival of an even younger signal zn + 1, the Order by one step so that the oldest value (of the oldest Signal) falls out.

Example:

at This example is the overview because of only four parallel time measurements provided in the lottery application can be extended to a few hundred, one of which each in turn makes thousands of measurements almost at the same time by the temporal displacement errors of each measurement taken into account becomes.

• Zeittakt des Zählers...
• zn, z3, z2, z1 DATEN (overflow1)
• zn + 1, z4, z3, z2 DATEN (overflow2)
• zn + 2, z5, z6, z3 DATEN (overflow3)
• u.s.w.

In the parallel time measurement, for example, to determine the most recent four characteristic signals with respect to the random signal generated as a random signal (minus tmin of this time) thus four addresses (0 ... 3) of a RAM needed, in which the time z * of the Beginning of the game (from the time of the can be issued to the identification signals) started time counter (which can be arbitrarily extended on the RAM of the processor if necessary), are written.

• Timing of the counter ...
• zn, z3, z2, z1 DATA (overflow1)
• zn + 1, z4, z3, z2 DATA (overflow2)
• zn + 2, z5, z6, z3 DATA (overflow3)
• etc

The Data thus correspond to the over the time counter read time values z *. The first row corresponds to the data z0, z1, z2 ... zn the time when the fourth identification signal than the recent Identification signal corresponding time value zn below each clocked Continuing the LIFO (last in - first out as usual can also be realized as RAM) the last (reserved) Memory has been fully written, with this scheme of is written left to right. Therefore, the leftmost is the respective current value, far right the oldest Value that is always pushed out, if left a new value is enrolled again. At the time of generation of the as Random signal generated start signal (minus tmin from this time) the time values are in the wrong direction as with registered mail (that is, the data is scrolled from right to left) read out and the difference to the time value of the time counter is formed, how it is stored when the random signal (S => REF) arrives. The LIFO limited Thus, according to the number of reserved memory slots the Number of stored action signals (identification signals) such that the last arrived according to the storage capacity of the LIFO, and the older ones overwritten become.

Furthermore, is at a correspondingly long playing time over the RAM (for storing the overflow passages), although extensible time counter somewhere (for lack of memory spaces of the RAM) a finite range of dimensions However, it is that practical the older Values that are no longer in the buffer memory (or already overwritten by newer values are worthless). That the time measurement can be retroactively one constantly New beginning (the outside must be the current values) Define by a simple correction (offset) offset to memory locations in RAM to save, since only those time values interest, which in the range the actual are stored in the buffer memory. Be in the cache then as a time value, i. here a characteristic signal to be stored corresponding records saved in a first simplified form e.g. have the following format:

• • dem vom Zeitzähler gelesenen Zeitwert z*
• • und der Adresse des Teilnehmers, der das Kennsignal abgeschickt hat
• • gegebenenfalls noch zusätzliche zum Kennsignal zugehörige optionale Paramter, z.B. der Ziffer einer Lottozahl, die der Teilnehmer zu dem Kennsignal mit abgeschickt hat (vgl. auch die Ergänzungen im späteren Teil der Beschreibung).

Data format: A data word consists of, for example:

• • the time value read by the time counter z *
• • and the address of the subscriber who sent the identification signal
• If appropriate, additional optional parameters associated with the identification signal, eg the number of a lottery number which the participant sent along with the identification signal (see also the additions in the later part of the description).

Consequently in the difference calculation of the time values also the winners be determined, or the relevant lottery numbers drawn were.

Simplification: In principle it is for a simple sweepstakes sufficient if only the addresses of the Participants are stored as data, with no time values, with the exact time values are not available during the evaluation, but only the order. However, this complicates control, if the program is monitored for manipulation by other external devices shall be. For The realization can be a pure server solution as well as a signal processor (DSP) implementation, the explained timing and in which explained the LIFO algorithm is realized.

Further explanation of the figures:

1 and 2 relate to an illustration of the preferred graphical representation (© Roman Koller, date of registration) for displaying the current relation between the reference value REF and the respective currently accumulated value S and how the sum value S depends on the input via the terminals of the participants action signals (identification signals ), or possibly also the reference value REF changes.

It's a tree beam 4 illustrated balance provided, wherein the tree beam 4 in the middle on a crossbeam serving as a bearing 1 rests. On the left side of the bar is the money bag 2 on, on the right is a basket 3 placed in which of on a tree 7 sitting monkeys coins (10) are inserted, which correspond to the input of the participants action signals (identification signals). Each time a participant clicks on the [toss coin] button, for example, a specific amount, for example, 10 cents, is deducted from the account of the respective subscriber (from the credit of a certain available number of action signals or also in monetary value, or also via telephone charges, etc.) , deducted, around which the money value "weight" of the bar on the right increases proportionately. For example, at 5 cents per paid amount of 10 cents. The portion n remaining for each action signal (identification signals) (from here eg, η = 50% or 5 cents) are diverted from the game to cover the costs.

In A further education option is provided with another button ["Monkey spring"] its operation is not only a single coin is thrown, but immediately the monkey jumps on the beam. A such action corresponds to the rating compared to the simple coin (here 10 cents) e.g. one 100 times the weight, but with respect to the paid-up, i. from Participants paid only ten times the value. This multiplier with the dS on the sum is effective, is called K factor become. That the participant pays 2 Euro (from which only weighs 1 Euro) and gets a weight of 20/2 = 10 Euro. with which he sums up the sum S, and this as well (automated) Burst series of delivered action signals (identification signals) implemented but can be safe in those by keeping the break time is posed that others Participants still fall in time between these action signals.

In order for the "box office" to be correct, the reference value must therefore be reduced by (10 - 2/2) = 9 euros. In the example shown, this is done in 1 , by a mouse annoys the parked on the left side of the bar sack of 1000,000 euros.

Example:

at the game amounts to the reference value REF 1000,000 euros, where for η = 50% (in this example) of 2000,000 euros over the participants the delivered action signals (identification signals) must be paid in order to the possible To be able to pay out profits of 1000,000 euros.

The current sum S, to which (in this example) because of η = 50% only always half each the amounts paid is added up, has increased to the value (1000,000 - 20) euros, i. exactly 20 euros or 400 entered action signals are missing (Identification signals) of the participants to end the game on the condition S => REF. To this time (the still missing 20 euros, which in their exact Height however the participant is not known) a participant presses the button ("Monkey spring"), what about this Participants 2 euros deducted and (because η = 50%) half, the are 1 euro for cost recovery and the other half, in this case multiplied is summed by the K factor (K = 10) on the sum S, i. the Sum S is increased by dS = 10 euros, but only 1 euro was paid on this sum. That's why the reference value REF is reduced by the difference of 10 euros - 1 euro = 9 euros. The sum S is therefore 1 euro lower than the reference value REF. That the game is far from decided. Even if immediate then another participant would let another monkey jump and with it the random signal S => REF indeed generated, but since he is already outside tmin lies, can not win, can the participant, the previous action signal (identification signal) with payment of 2 euros have missed the profit, if he is too close (namely within from tmin) on the subsequent action signal of the further participant is. Then you would have e.g. the participant won, which before, but outside from tmin an action signal for 20 cents has delivered, etc. Or if the probability switch is still envisaged, there is the possibility that it is for current time, where S => REF, at all does not come to generate the random signal, but it remains the current reference value REF exist, or is increased even further, so that the Game can go on.

In 2 can also be seen as from the left tree 6 three monkeys right on the money bag 2 Side of the beam 4 jump. This is indicated when the game is decided by the probability switch described so that the money bag ( 2 After a short pause for this process to be perceived, one becomes on the left tree 6 sitting monkey an extra money sack ( 5 ) in addition to the already existing ( 2 ) on the balance (bars 4 ) ( 1 ) and the apes jump off the beam again 4 so that the new reference value REF is the sum of the old money ( 2 ) and the newly added ( 5 ), eg 1000.000 plus 1000 applies. Will none of the participants in the existing overweight play, then it is envisaged that the larger money bag ( 5 ) something inflates and incrementally eg to the value 1000.0100 is increased, whereby by a monkey the small money bag ( 2 ) again from the beam 4 is pushed down. This means that the reference value has been reduced from 1000.1000 to 1000.0100, as a result of this spontaneous weight reduction, the beam teeters between its horizontal layer and the one in the Drawing back and forth, so that the players get in and delivered their action signals (identification signals). If this is not true, then the reference value is simply further reduced and the bar continues to rock constantly, whereby with increasing approach to S = REF, the bar also tilts briefly to the right over the horizontal line for a short time.

For an application for a lottery game, it is useful after each generation of a start signal S = REF, which means a number drawn, in principle, the reference value REF (on the money bag 2 Page), which initially results from the amounts paid in to the completed lottery tickets. As already explained, a drawn lottery number then corresponds to the number that a subscriber who was drawn (upon arrival of the starting signal) selects each time he sends his action signal (identification signal) from the ticked his lottery ticket or (in an optional variant) from the server gets.

there be as usual the lottery numbers, in several for every drawn number provided provided passageways. In the usual mechanical lottery draw corresponds to a passage of each rotation a drum with the subsequent Figure out the number. With the new IT process, each pass is the same each generating the start signal S> = REF, taking into account the minimum time tmin the action signal (identification signal) of a respective subscriber select and over the previously assigned to the subscriber before the start signal S> = REF Lotto number to determine this lottery number as a drawn number, or (for one another option, later even closer explained becomes) a number row over to determine in time consecutively arriving characteristic signals, from the over a number drawn in the previous draw operation with the number drawn within this series it is determined which the profit to allocate is.

The Summands dS, which are the votes of the participants (or their terminals) Action signals (identification signals) each assigned as equal shares dS be around by constantly Sum up the sum S = n · ds are determined so that the maximum payout Profit value REF is divided by the factor n. Get the factor n We set the number of participants ZT by a ratio m is shared. n = ZT / m, so n is smaller by this factor or dS correspondingly larger fails. It have to Therefore ZT / m participants delivered an action signal (identification signals), around the start signal S> = REF where m <1 is, the participants each issued several action signals (identification signals) have to to get S> = REF, ditto for m> 1 only a fraction of the participants.

at Each passage is therefore a relevant number found, where in the next Pass the already drawn numbers for an assignment to the action signal (Identification signal) of the participants are no longer allowed, or the Participants are no longer available for selection.

There is still the option to make the game even more interesting by the players in addition to the possibility to play for the purpose of drawing the lottery numbers free money, can also play for money by selecting this option beforehand. The procedure is such that the sum of the sums of money arriving via the action signals (identification signals) is taken from a second sack of money which, in addition to the first ( 2 ) on the beam 4 is turned off and this additional money bag grows with the number of charges received to the action signals (identification signals). This second money bag then does not form the reference value for the lottery draw, but the content is then divided among those participants, on the action signal (identification signals) has been drawn in each case a lottery number of the valid (having a winner) number series.

To every generation of the start signal S> = REF is the mean inclination angle α of Libra. or the bar, zero and rock around this zero position (where on both sides e.g. a monkey jumps on the beam to swing). Otherwise, the information already given applies. Be an approximation of S to REF, the left end of the bar (where the money bag is) starts knocking the bottom B, the longer the beam end (over the Pulse duration) from the ground, the closer the value S approaches REF, after further approach overshoots to the right (α negative), until reaching S> = REF the swinging movement begins.

A Variant of the game is that the Reference value REF from any participants also step by step elevated can be when the bar is near the intersection of S> = REF. In which this only those participants can the already fees have paid with the delivered action signals (also respectively dependent from the number of fees already paid, etc.).

3 concerns four diagrams, represented over the time axis t (time) of the play history:
The top diagram illustrates how the start signal is generated from the two values reference value REF and summation value S at the intersection S> = REF at time ts. In this diagram, two optional cases, one or the other of which can occur, and which are decided by using a probability dip, are shown in this diagram:
In the first case, the profit is paid out immediately if the sum S reaches or exceeds the reference value REF (S => REF), which corresponds to the start signal ts (1).

in the In the second case, when generating the start signal (S => REF), the profit does not paid out and held the reference value REF, or to continue playing elevated, which corresponds to the start signal ts (2).

The Distinction of the two cases provides the probability crossover, which in the variants discussed accomplished is, and these variants can also be combined.

The Probability switch is realized by the server additionally action signals generated in a ratio the desired Probability of the action signals sent by the participants homogeneously distributed (diversified) with these added the first case occurs when the increase in the Sum S, which generates the start signal ts (1), by the action signal (Identification signal) of a subscriber is generated, and the second case occurs when the increase the sum S, which generates the start signal ts (2), by a from Server self-generated action signal is caused. As already explains This first variant of the probability crossover can still be done by a second supplemented or replaced at which the generation of the start signal ts (1) or start signal ts (2) superposed with a coincidence condition which concerns the result of a test, whether the respectively increased sum by the action signal (identification signal) of a subscriber S is even or odd. For example, e.g. set that at a even value of the sum S when the start signal ts occurs (1) the game ends, the reference value REF = 0 is set and the win paid out, but at an odd value of the sum S, on the occurrence of the start signal ts (2) continued the game, the Reference value REF held, or increased and no profit is paid out. In addition to these two basic variants for the realization of the probability crossover can still the explained Methods for the division, distribution or redistribution of the triggered an action signal Increase dS (input) between sum value S and reference value REF be applied to also control the reference value REF.

In 3 Furthermore, the profit of the operator (profit machine) is shown how it reduces using a probability switch of the first version and continues to finance from the votes of the participants action signals, or characteristic signals (second diagram). However, the reduction by the probability switch of the first version (which accelerates the approach of the sum value S to the reference value REF) can be well compensated by the additional use of the further described variants, as already explained.

In the registration phase, where no action signal is issued, each participant must pay a registration fee dS and it thus increases the sum S = n · ds (with the number n of applications, also fill in lottery tickets, etc.) and therefore the profit (with x as a percentage) = (1 + x) · S - S = x · S until the beginning of the game. At the start of the game (after the end of the registration phase), a certain sum S has therefore accumulated (also on paid-in money), with a fixed reference value REF being initially defined as the start condition. With increasing curve of the sum S, this sum approaches the reference value REF, wherein before it is exceeded, the game starts, or if it does not yet begin, the reference value REF is incremented in incremental increments just enough for the condition S => REF is not reached, ie the start signal is certainly not generated. At the beginning of the game, the reference value REF is just above the value of the sum S and rises after a ramp (by a corresponding random function) and is lowered again, so that the reference value REF again approaches the sum S, ie by summing the action signals of Participants assigned the condition S => REF could be achieved. However, the probability crossover is switched on at the falling ramp of the reference value REF. This makes it possible to repeat this sequence of the ascending and descending ramp of the reference value REF several times, if by chance the probability crossover so decides that on receipt of an S => REF is continued, the reference value is first additionally increased in small steps, to get the game started and only then ramp up the ramp and drop again, to animate the players who have dropped out of the rising ramp, of course, back to the game. That the reference value REF returns to the sum value S, the players (participants) are indicated by the bar ( 4 . 1 . 2 ) not only tends towards horizontal, but by a pulse on the floor B suggests what the in 3 represented by duty cycle modulation controlled pulses corresponds. In this case, this duty cycle modulation is controlled so that at a greater distance (still in the near range of S => REF) of the bars ( 4 ) strikes the ground B over a longer duration with a shorter pause, and at a small distance, ie very close to the intersection of the curve S with the reference value REF, hits the ground B only over a very short duration with a longer pause time in the horizontal , possibly also in the case of intensive proximity to S => REF, overshoots (ie in 1 respectively. 2 the angle β becomes negative for a short time according to this overshoot).

The Control of change of the reference value REF may be next to a simple incremental change also taking into account the probability principle, as in the two examples (tables) in the preceding part of the Description already in detail explained has been.

• – Um den Referenzwert möglichst steil nach oben zu steuern, wird von der Kombination der beiden Methoden Gebrauch gemacht, einmal das geldwerte Input aufzuteilen zwischen Summenwert S und Referenzwert REF, wobei der Referenzwert REF erhöht wird und ein geldwerter Überschuß entsteht, wie zu einem Beispiel bereits erläutert wurde (z.B. bei einer Aufteilung von 50:50) und weiters noch dieser Überschuß dazu verwendet wird, um mit einer Wahrscheinlichkeitsweiche der ersten Variante die Annäherung des Summenwertes S an den Referenzwert REF zu beschleunigen (über die vom Server erzeugten internen Aktionssignale, die als Gewichte die Erhöhung des Summenwertes S durch die Teilnehmer, bzw. den Anstieg von S verstärken), was wiederum eine Erhöhung des Referenzwertes durch die Wahrscheinlichkeitsweiche begünstigt. Die Umschaltung der beiden Methoden erfolgt automatisch über die Bewertung der jeweiligen Dichte der in den Server eintreffenden Aktionssignale, so daß der beschriebene Effekt eines versteilerten Anstieges des Referenzwertes REF (gesteuert über die Wahrscheinlichkeitsweiche) eintritt.

In this way, the triangular-shaped reference value REF also tends upward (like a stock price) until it is steered steeply upwards by the onset of the delivery of numerous action signals (identification signal) of the subscribers after the first start signal ts (1) arrives. the probability switch has decided so that the reference value REF is held, ie the profit is not paid but increased and continue playing. Only at time ts (2), when the condition S => REF occurs, since the probability switch has decided to pay out the profit, the reference value REF is set to zero to start a new game.

• In order to steer the reference value as steeply upward as possible, the combination of the two methods makes use of dividing the monetary value input between the sum value S and the reference value REF, whereby the reference value REF is increased and a monetary surplus arises, as already shown in an example has been explained (eg, with a split of 50:50) and still this excess is used to accelerate the approach of the sum value S to the reference value REF with a probability switch of the first variant (via the internal action signals generated by the server, as Weights increase the increase of the sum value S by the participants, or the increase of S), which in turn favors an increase of the reference value by the probability dip. The switching of the two methods takes place automatically via the evaluation of the respective density of the incoming into the server action signals, so that the described effect of a steepening increase of the reference value REF (controlled by the probability crossover) occurs.

So that the reference value REF swings up as high as possible when the random event occurs at a start signal ts generated according to the condition S => REF and the profit does not have to be paid out immediately, the ratio of the probability with respect to the generation of an action signal (on occurrence of S => REF) is controlled so that at a lower reference value REF, the probability that a profit is not paid, but continues to play is higher, or the probability that the profit is paid increases with increasing reference value REF, by For example, the ratio of the action signals generated internally by the server relative to those generated by the subscribers may be controlled, or by a divisor if the probability switch is made by deciding whether the sum S is an even value or an odd value, ie at a divider ratio of eg T = 3 only every third person te even value of the sum S, on the occurrence of the start signal ts (1) the game ended. This means that T can be used to preset the statistical probability of the branching of this probability curve. See also the later explanation too 7 ,

The fourth diagram shows an example of the time course of the Correction factor with which the profit must be corrected so that in realization of the probability crossover by internally generated Server signals that are not covered by monetary value, no deficit arises. This correction can also be omitted or is mitigated if e.g. the probability dodge not by an excess of action signals (which increase the sum S) but by filtering, e.g. by deciding whether the sum S is an even one Value or an odd value is formed or already explained further measures for compensation (e.g., while increasing the reference value REF) to be used with.

Note: Instead of that Totaling of the deposited monetary value by summing the sum S by the action signals (characteristic signals) emitted by the participants It can also be done exclusively, or mainly through the Duration of the filing phase are formed by the filing fee, so that the reference value REF equals a high value right at the beginning. Each participant so to speak, in presale (cheapened) any number of entitlement for the delivery of action signals, and at the normal price even while can still buy the game. According to the during the application phase already received action signals is then the something about the Sum S set reference value REF.

4a illustrates the evaluation of the action signals (identification signals) when the start signal S => REF occurs; zn ... zn-3 ... zn-x refer to the action signals (identification signals) given by the participants, or their data (assignment addresses of the participants, read time values, optional data such as weights, etc.) as they successively according to their time of arrival in the LIFO memory ( 4b ). When S => REF is reached, the LIFO memory is read out of order so that the last written value is the first value. Seen in this way, the memory organized as LIFO memory can also be seen as a shift register whose shift direction is switched when S => REF is reached and in which the older values are shifted out again after passing through the register length.

# 1 ... # 5 relate to the sequence of the triggering of the action signals (characteristic signals) by the participants.

# 5 and # 4 are triggered by the same subscriber (or terminal). there is trying to # 5 trigger an action signal, this signal suppressed because after triggering from # 4 the break t is less than the minimum time tw, after the the next Action signal (identification signal) issued by the same participant again can be. It must tw By no means be a fixed time, but may depend on Rush of participants (to give an action signal) from the server be controlled. When tw expires, it will trigger # 5 associated Action signal (identification signal zn-4) is output. should be in the meantime (within tw) a repeated trigger # 6 has taken place, then this is ignored because the triggered signal has not yet been output has been. The ignoring is e.g. by a corresponding warning tone (possibly also with a short message) to the user displayed.

5 illustrates an example of networking.

The subscribers ad0 ... adn are connected with their terminals (browsers) via the Internet IT to the server. In addition to the program that runs in the server to implement the described method, a protocol station is still provided, the task of which is independent of the server to record a control file. This control file contains the exact sequence of the action signals of those subscribers who have entered the server when S => REF has been reached, ie when the start signal ts was generated immediately before this time (stored in the number specified by the LIFO). In order for the protocol station to operate autonomously, the protocol station is likewise connected to the subscribers via the Internet. In this case, the subscriber identification can be done via the server, or by using the pre-notification DE 10 2004 046 413.8 Also completely independent of the server on the preferred in this application telephone loop a landline or a mobile phone. The winner will then be identified by the telephone number under which the subscriber has logged on. Thus, the protocol station as well as the server, even if the provider assigns to the subscriber only a temporary IT address, as a fixed reference address has the telephone number of the subscriber, regardless of which IT network he uses. In this case, the WEB page, or even the browser on the user side (on the terminal) supporting auxiliary software is provided, which in addition to the server, establishes the connection to the protocol station. The protocol station receives from the server via a secure (encrypted) connection SEC those data (parameters) that it uses to from the action signals (identification signals) of the participants to form the sum S, he also transmits the reference value REF and the time tmin. And if variably controlled by the server, even the blocking time tw, which must wait for a participant to be able to issue an action signals (identification signals) to the server repeatedly.

With The protocol station generates the start signal (S> = REF) for this data and sets the Order the immediately before the start signal, but still before From the time of the start signal deducted time tmin arriving Action signals (identification signals), or their data independent of Server stuck.

The Protocol station is then, for example, at a notary under Closure and it will be the winners determined by the server with those of the notary compared. will the procedure for If a lottery is used, then the one participant will be removed from the server assigned, and thus the action signals (identification signals) of the subscriber respectively assigned lottery number initially transmitted from the server to the terminal of the subscriber and from there the protocol station, each as part of the Action signal (identification signal) of a subscriber respectively associated data. That all relevant to each participant, game crucial Data is not transmitted directly from the server to the protocol station, but about the terminal each participant looped through each, so manipulations excluded are.

The practical realization of the protocol station is carried out, for example, by a signal processor whose program is permanently stored on a chip or in the processor, that is not changed by external data carriers can be changed. This circuit is installed in a sealed security case. The device has a direct network connection to the computer of the notary on its Internet interface, ditto the server is networked with the computer of the notary. The notary can thus compare both processes, the server and the protocol device directly, even software supported by numerical values and diagrams, or the time is recorded in the temporal proximity of the start signal on the computer of the notary.

To 6 : For an application of a lottery game, the following training variant is provided in particular, such as 6 as an example:
In addition to the in 1 respectively. 2 represented image, which indicates the proximity to the start signal S> = REF, is still another, second image ( 6 ), which is a lottery drum 100 with the lotto balls swirling around in it. However, the balls move so slowly that the balls can be tracked well with the mouse and the desired numbers, or balls can be clicked. In this case, the calculator forms subsets of all balls remaining in the game and displays them alternately, so that each of the balls present in the game over the same time periods in the drum is (because not all balls can be displayed within the drum). Balls that have already been drawn are no longer displayed in the drum.

If a ball is clicked, then the action signal (identification signal) is sent, taking tw into account. In the other picture, in which the beam balance (after 1 . 2 ), the arrival of the action signal to the server is indicated by a clearly visible in the basket ( 3 ) falling coin on the screen of the subscriber, which outputs the action signal (identification signal), represented. The ball, or number, which the participant has currently selected from the drum by clicking on, falls down at the neck 101 and will be displayed to the participant.

Furthermore, in the picture in which the lottery drum is shown ( 6 ), a list I ... V ... (protocol) is displayed individually for each subscriber in order to display the numbers sent by the subscriber to the action signals (identification signals). As from the in 6 As shown in the example shown, the subscriber has three times the number 25 with its action signals in each case sent in succession, but no success, then he still has the 22 and 4 sent, etc. On arrival of the random event, or the star signal S> = REF However, the 25 is drawn (by another participant) and displayed to all participants alike. For example, through the upper neck 102 from which the drawn number is thrown out and into the collecting tray 103 falls in which all drawn numbers are displayed. If the subscriber (the display) has drawn the number, then the number of this subscriber is highlighted in color in the individual list, or can also be highlighted by flashing.

After each drawn number, the draw is restarted, or at each draw the start signal S> = REF generated to determine the time of the generation of the start signal on the next, but still outside of tmin action signal (identification signal). If a number (such as in 6 just the 25) pulled, then this ball, or number at the next draw is no longer available for selection in the drum. This means that in this variant it is sufficient to limit the LIFO to 1 bit (or possibly a few bits) in length, and thus a simple latch or short register could be used which stores the data (time values, address, etc.). However, it makes sense to also store a long series of time values, especially if the time tmin is also generated as a random number, as will be described in more detail below. In this case, so many time values of the action signals (identification signals) must each be stored, as must be stored according to the density of the incoming action signals due to the intended range of variation of tmin between, since the attributable within tmin action signals are no longer evaluated and only the action signal for the Draw is decisive, which is the time tref = ts - tmin closest. In 4a this is thus the action signal (identification signal) zn (# 1) to which the lottery number selected by the participant when sending zn (eg "25" in FIG 6 ) and the address of the subscriber (or his terminal) and optionally further data, such as further from the server to the participants assigned random numbers, etc. are stored.

Note: Besides the possibility to generate the start signal from an increasing summation of the sum S. (S> = REF with dS positive) there is also the possibility the start signal from a decreasing summation of the sum S to generate (S <= REF with dS negative), if S has a corresponding start value above REF is set.

As already explained, the time t min, which was introduced to avoid manipulation, with ei generated random generator. In order to avoid a manipulation of tmin, tmin is also generated by the game itself as a random number in further development. For this purpose, the server assigns to the participants as homogeneous a distribution as possible a set of numbers in a certain area. For example, 100, 101, 102 ... to 2000. These values have, for example, the dimension milliseconds. In this case, each value should account for the same number of participants, eg one hundred values a "100", one hundred values a "101" to one hundred values a "2000", etc., or the resolution can be further refined, depending on how fast is the throughput of the networked data, however, while respecting this condition, the allocation of these data to the individual participants is random.

If the number of participants changes, so does the number of distribution. For each sent by a participant action signal (identification signal) then the number assigned by the server is sent, whereby there is again a log file as in the drawing of lottery numbers, but not the participant is displayed, but especially in the protocol station ( 5 ) is logged with, of course, in the server. It makes sense, for example, to loop through the data encrypted by the participants, for example, such that the selection of the value series is done in the server, but the assignment in a look up table in the protocol device, which in the protocol device from the table to an action signal (identification signal ) is then transmitted to the server. For example, this table in the protocol device is coded as follows: Address dez4095 = "100"; Address dez4094 = "2000" ... dez0 = "312" whereby the entire time value series is coded as data for the addresses. The assignment of the value series to the addresses also takes place for each number drawn in the protocol station according to the random principle, for example realized by a signal processor (DSP).

Consequently only for the (first) draw of the first digit of the server the time value tmin generated by a random number generator in the program, and at the first digit already the time value tmin for the next digit by the participants itself as a random number is determined, such as the drawing of lottery numbers itself. the one in addition to the drawn lottery number with dragged time value tmin is used for the next draw.

Mach The same principle can be applied also the reference value REF within a certain value range determine as a random number in a game. In relation to this Reference value REF, a sum value S is added up to the value REF, which correspond to any variable of any game can order over the condition S> = REF to generate a random time (when the condition is reached). So could also an over generate the value of REF starting value for S as a random value, by a gradual reduction of S on the condition S <= REF a random time (when the condition is reached). The generated random time can be used arbitrarily in any other game become. Instead of the mentioned action signals can also be within a game subsets assigned to subscribers (e.g., controlled participants networked via IT), on the one hand by the participants each affected are (also by indirect inputs, etc.) on the other hand by the Game affects are and in their cumulative effect, or about their interaction (in the game) influence a value (sum value S) so that it is equal to the reference value REF is approaching and generates the random time when it is reached. It can the reference value is generated as a random number over several draws be, e.g. above all draws added up, and still a threshold match, about which must be the value lying as the sum of random numbers, so that he as valid Reference value corresponds. In this variant is then by the generated random signal (corresponds to said start signal) in the game a process is triggered the one according to a given, and transparent for the participants Algorithm re-evaluates the weights associated with the subscriber, to determine the winner (if any, winners) and if necessary, the game ends.

The Method is thus applicable in the most general way. Thus, e.g. also for implementation a raffle of money sack or the reference value REF equated to material assets and denote the random numbers drawn by the winners the things to be won, etc.

Supplementary explanation to 6 In the log file I, II,... V ..., in addition to the Lotton numbers (LTO) sent by a subscriber to an action signal (identification signal), the time values (tmin) allotted by the server for each delivery of an action signal are also included displayed, but not as a value, but only as the address ADD, under which this value is stored in the server or in an external attachment to the server (therefore unidentifiable to the participant during the game, but verifiable after the game). This data can also be stored in the Cooky directory on the host computer of the subscriber. The RAM addresses ADD are randomly distributed to the time scale (tmin) data generated by the server, but distributed homogeneously among the participants and the associated data for each new draw (generation of a start-up) is remapped to the addresses ADD in the protocol station. The time value (tmin) respectively stored under a respective address is then, like the lottery numbers, drawn as a numerical value assigned to the action signals, ie as a random number from the total number of numbers (here the scale) and at the next draw (or generation of the random signal). used as the time value tmin.

Further Option: Another option is, besides the randomization of tmin also the position number within a variety of Positions of a fixed row, e.g. of ten positions in the Range 0 ... 9 to produce at random, this on the same way as for t min. The drawn position then determines in each case for the next draw (e.g., for the next generated star signal) that position within the number of Positions defined row, which is considered pulled, where the Series itself determined by which is closest to the start signal, or, if applicable, after subtracting tmin. This prinizip cascading "nested Chances "can be applied as often as you like. The difference of generation of the Random value of tmin and the position number is that at the beginning of the game for dragging the first digit, the value of tmin via a software random number generator is calculated and for the others are determined by the preferred random principle, and for the value of the position, e.g. the position 1 according to the Time of the start signal tref = ts - tmin nearest action signal already the position for determines the subsequent draw.

More options and advantageous Further developments of the invention and an overview of the most important, under the addresses of the buffer LIFO between stored data:

A another variant for the realization of a probability dipterm to decide whether at the arrival of the random signal (S => REF) the profit is paid or whether the reference value REF is held and played, is the payoff of profit (or playing, etc.) depends on it make that that Random event (S => REF) must arrive in a certain predicted time interval tx. This Time interval is generated by a random number generator, wherein the Random generator is realized again by the method, such as already for the drawing of the lottery numbers and the time value tmin are described has been.

• – D.h. sind für den Pufferspeicher LIFO, dessen erforderliche Größe von der zeitlichen Dichte der eintreffenden Aktionssignale (Kennsignale) und dem Zeitbereich von tmin abhängig ist, beispielsweise 32768 Speicherplätze vorgesehen, dann wird jedes eingeschriebene Aktionssignale (Kennsignal), bzw. besser formuliert, deren nachfolgend aufgelistete Daten (die jeweils zu einem Aktionssignal gehören) nach 32768 +1 Schiebetakten im LIFO Speicher überschrieben. Die bei diesem Beispiel angegebene Anzahl von Speicherplätzen bezieht sich jeweils auf die Referenz (der Adressen), die jeweils auf alle zu einem Aktionssignal (Kennsignal) angegebenen Daten (einer Datengruppe, wie sie als Beispiel nachfolgend angegeben ist) zeigt.

Here is an example of the stored under the addresses of the action signals (identification signals) which are stored in the buffer memory (LIFO) for later determination of their temporal order next to the time values of the action signals, with only a limited number of action signals according to the intended length of the buffer memory ( LIFO) are stored, ie older data according to the already explained limitation of the LIFO be overwritten by younger data respectively.

• That is, for the buffer memory LIFO whose required size is dependent on the time density of the incoming action signals (identification signals) and the time range of tmin, for example, 32768 memory locations are provided, then each enrolled action signals (identification signal), or better formulated, the following listed data (each associated with an action signal) is overwritten after 32768 +1 shift clocks in the LIFO memory. The number of memory locations indicated in this example refers to the reference (s) respectively, each of which points to all of the data indicative of an action signal (a data group, as exemplified below).

• a) Teilnehmerdaten sind einmal persönliche Daten, welche geeignet sind, um den Teilnehmer bei Bedarf zu identifizieren. Dies kann durch persönliche Angaben erfolgen, oder durch ein Verfahren z.B. nach der DE 10 2004 046 413.8 , etc. Sind die Teilnehmerdaten nicht erforderlich, dann kann auf sie verzichtet werden, wobei dann bei Verwendung der betreffenden Wahrscheinlichkeitsweiche (vgl. erste Variante) durch ein Kennbit festgehalten wird, ob es sich bei einem in den Server, bzw. Pufferspeicher eingeschriebenen Aktionssignal um ein von einem Teilnehmer abgesendetes, oder um ein intern erzeugtes handelt. Zu den Teilnehmerdaten gehören auch Abrechnungsdaten, wenn z.B. ein Aktionssignal über einen Telefonserver eine Abbuchung von der Telefongesellschaft enthält. Wird das Verfahren nach der DE 10 2004 046 413.8 verwendet, dann ist für die IT Verbindung der Browser Station auch keine Modem Verbindung erforderlich um über eine Telefongebühr die an den Server von den Teilnehmern jeweils abgegebenen Aktionssignale zu bezahlen.

A zn-x address incrementally incremented in the course of the continuous writing and overwriting of the data (cf. 4a and 4b ) of the buffer memory LIFO contains, for example, the following data which can be broken down into random number generation data relating to the generation of a number (eg a lottery number) at the next draw (ie generation of the start signal S => REF) and here as general Data to be called, and further data that are associated with the subscriber and are referred to as subscriber data, and thirdly still data that are assigned to the participants on the one hand, on the other hand influence the entire game and referred to here as "connection data" (but nothing with data of a Telekom connection has to do, etc.).

• a) Subscriber data is once personal data that is suitable to identify the subscriber when needed. This can be done by personal information, or by a process such as the DE 10 2004 046 413.8 , etc. If the subscriber data is not required, then they can be waived, in which case when using the respective probability switch (see the first variant) is recorded by a Kennbit, whether it is in an inscribed in the server or buffer memory action signal an item sent by a subscriber or generated internally. Subscriber data also includes billing data, for example if an action signal via a telephone server contains a debit from the telephone company. If the method according to DE 10 2004 046 413.8 ver applies, then no modem connection is required for the IT connection of the browser station to pay via a telephone charge to the server by the participants respectively submitted action signals.

• – die Zeitwerte, bzw. Zählerstände zn...zn-x des Zeitzählers (der von "Begin" gestartet wird, vgl. 4a und 4b), wobei sich nach längeren Zeiträumen, in denen die Aktionssignale im Pufferspeicher schon durch aktuellere Werte überschrieben worden sind, der Zeitpunkt "Begin" jeweils schrittweise verschieben kann, bei entsprechender Offsetwertkorrektur des Zeitzählers, damit die abgespeicherten Zeitwerte nicht zu viel Speicherplatz beanspruchen. Der Zeitzähler darf dabei auch beliebig oft mehrmals durch Null gehen, weil der Overflow Status, gleichfalls mit abgespeichert und bei der Berechnung der Zeitspannen berücksichtigt wird.
• – Zahlenwerte, welche die aktuelle Ziehung betreffen, wie z.B. eine dem Aktionssignal bzw. Kennsignal zugeordnete und vom Teilnehmer durch Anklicken (z.B. innerhalb einer Lottotrommel) ausgewählte Lottozahl (LTO), die als gezogen gilt, wenn die zeitliche Position des Aktionssignals bzw. Kennsignals in Bezug zum über das Zufallsereignis (vgl. S>=REF) erzeugten Startsignal einer Gewinnerposition entspricht. Diese Zahlenwerte sind optional und entbehrlich, wenn z.B. nur ein Zeitpunkt oder eine Reihung der Teilnehmer durch das Verfahren als Zufallsergebnis erzeugt werden soll,
• b) Allgemeine Daten sind die vom Server an die Teilnehmer verteilten (gegebenenfalls weiteren) Werte, die als gezogen gelten (genauso wie die Zahlenwerte LTO der Teilnehmerdaten, falls solche vorhanden sind) wenn die zeitliche Position des Aktionssignals bzw. Kennsignals in Bezug zum über das Zufallsereignis (vgl. S>=REF) erzeugten Startsignal einer Gewinnerposition entspricht, wobei diese Werte bei der nachfolgenden Ziehung (über ein weiteres Zufallsereignis, d.h. bei einer weiteren Erzeugung eines Startsingals durch S>=REF) verwendet sind und betreffen für eine optionale Weiterbildung der Erfindung die (weitere) Ziehung der Werte für die Zeit tmin (innerhalb einer Bereichsskala ausgewählt), gegebenenfalls auch der anderen im Verfahren optional verwendeten Zeitwerte (z.B. zur Einstellung von tw oder tx, etc.), weiters die optionale Verwendung einer Positionsziffer, um innerhalb einer als "gezogenen" festgestellten Reihe das als endgültig gezogen geltende Glied innerhalb der Reihe, welche im der Ziehung der Positionsziffer jeweils nachfolgenden weiteren Ziehungsprozeß gezogen wird, zu bestimmen. Dabei werden die Werte, welche jeweils in der nächsten Ziehung verwendet sind, wie Positionsziffer, die Zeit tmin, gegebenenfalls noch die anderen Zeitwerte im jeweils selben Ziehungsprozeß gezogen, wie die Ziehung der LTO Zahl (z.B. Lottozahl), welche dann die Werte des vorherigen Ziehungsprozesses verwendet, usw.

Furthermore belong to the participant data:

• - the time values or counter readings zn ... zn-x of the time counter (which is started by "Begin", cf. 4a and 4b ), wherein after longer periods in which the action signals in the buffer memory have been overwritten by more recent values, the time "Begin" can each shift gradually, with appropriate offset value correction of the time counter, so that the stored time does not take up too much memory space. The time counter may also go through zero repeatedly as often as possible, because the overflow status is likewise stored with and taken into account in the calculation of the time periods.
• Numerical values which relate to the current draw, such as a lottery number (LTO) assigned to the action signal or identification signal and selected by the participant by clicking (eg within a lottery drum), which is considered to be drawn if the time position of the action signal or identification signal in With respect to the start signal generated via the random event (see S> = REF) corresponds to a winning position. These numerical values are optional and dispensable, if, for example, only one time or a ranking of the participants is to be generated by the method as a random result,
• b) General data are the values (possibly further) distributed by the server to the participants which are considered to be drawn (same as the numerical values LTO of the subscriber data, if any) if the temporal position of the action signal relative to the Random event (see S> = REF) generated start signal corresponds to a winner position, these values are used in the subsequent draw (on another random event, ie in a further generation of a start S = REF) and relate to an optional training of Invention the (further) drawing of the values for the time tmin (selected within a range scale), optionally also the other time values optionally used in the method (eg for setting tw or tx, etc.), furthermore the optional use of a position number within a series determined to be "drawn", the member considered final, within the series, w elche in the drawing of the position number each subsequent further drawing process is drawn to determine. In this case, the values which are used in each case in the next draw, such as position number, the time tmin, possibly also the other time values are drawn in the same drawing process as the drawing of the LTO number (eg lottery number), which then the values of the previous drawing process used, etc.

Furthermore, can as a random number also possibly reference values REF (within a range scale selected) for the in a subsequent draw changed reference value REF the draw of the LTO number (also basic values or intervals, if REF is incrementally adjusted, or also time values of a time cycle with which this incremental adjustment is to take place, etc.).

So that the general data on the drawing of the action signals or characteristic signals (via their addresses) can be drawn, they are assigned to the participants in the delivery of their action signals (previously). This assignment takes place at random according to a random number generator implemented in the server, which makes the distribution of these data (ie the assignment to the action signals output by the participants) homogeneous among the subscribers. That is, for each given value series (scale) of a variable, such as the time tmin, or a position value, etc. each value is assigned to an equal number of participants. The distribution itself, ie which value is supplied to each participant, is not static but also rotates. That is, if the same subscriber successively sets off 10 action signals (identification signals), then each action signal is assigned a different value of the general data, or after each received in the server by one participant action signal immediately allocated the next by a random process from the value series or encrypted transmitted, this can also be done via the protocol station, or this external periphery can determine this assignment to the participants, bypassing the server by the client computer (browser computer) the associated data is transmitted encrypted as Cooky and the server are given to each delivered action signal. The distribution of the general data to the draw active participants can either be done by an external protocol station or recorded only for later control, etc. The participants themselves can not see the general data, as to the participants only the references (addresses, see also ADD 6 ) and not the data will be sent. The assignment of the data to the addresses takes place either in the server or in an external protocol station, whereby this assignment likewise takes place using a random number generator and can actually be pulled again like an LTO number, ie also the assignment of the general data to the addresses ADD under where they are stored, can be done according to this principle, in which case a random number generator of the server, for example, the Addresses, or their references sent to the participants, or assigns them, so that in the drawing process, the order can be ordered by random principle, in the server, the data are then stored according to a fixed sequence (forced sequence) and this fixed sequence of the Randomly assigned to the ranking of limbs accordingly.

Example:

• a) In the server and / or in the protocol device, etc. are consecutive in a particular memory segment References (pointers) stored on corresponding data: D1, D2, D3 ... Dn
• b) By a random generator, the participants reference Transmits addresses, or assigned, whereby this process is logged.
• c) It is explained by the Random in the server or possibly in the protocol device following Sequence drawn: RAD501, RAD207, RAD3, RAD207, RADS, RAD3, RAD1001, ... etc. The repetitive same addresses are eliminated so that the Sequence arises: RAD501, RAD207, RAD3, RAD5, RAD 1001, ... etc. These reference addresses refer to a (after the random result created) reference table to the addresses: ADD0 ... ADD1023 ... ADDn. one certain segment, which refers to the references D1, D2, D3 ... Dn show the data.
• c) "connection data" will be like the general one Data in the drawing process with pulled, only they serve a slightly different use, which is also refers to the participant. For example, it makes sense if the selection of lottery numbers by the participant is not through Click the full one Number of all (except for the already drawn) lottery numbers done should (which is the simplest variant, but not the most effective to keep the game going) but by clicking each reduced within a lottery drum shown Number set, whereby in each case after a slow time function the Numbers of balls constantly changed will be available to the distribution of the available for selection Also to influence the numbers on the participants and though by an algorithm that uses the previous draws with drawn values used to control this distribution.

In this variant, variables are still used in this variant, which correspond to the following distribution function, wherein the lottery numbers of a participant ticked in the lottery ticket are also used for this control:
It is evident (and sense of the thing) that each participant necessarily wants to bring each those numbers into play, ie to his action signals (identification signals) sent to the server, which he on the lottery ticket (or the lottery tickets) also via the Internet has ticked off, and which are stored under the personal subscriber data (as master data for this drawing of the numbers) in the server. Lets the number of participants in the game, then in addition to the lowering of the reference value REF the interest of the participants to send action signals are reinforced by the fact that for each participant who participates in the game (ie has logged in), but no action signals (identification signals) sent off, just those numbers in the drum are displayed, which he has ticked on his (his) lottery tickets). In this case, however, the homogeneous distribution, ie that each number (still available) for the draw (except for those already drawn) is available to as many as possible of the number of participants is retained. This means that there are also (temporarily) disadvantaged participants who do not have the high number of numbers they just ticked out in the drum (but only a smaller one). However, since the selection of those participants who have as many of their own numbers in the drum to choose from rotates in time (so that all participants have the advantage that they can send as many of their numbers with the action signals or Kennsignalen) is statistical seen none of the participants of the game at the draw disadvantaged. It is then only more important in which order, based on the participants, this rotation is made. This order can be pulled through a series of numbers at each draw to use that order at the next draw. Thus here too the random principle is preserved.

The draw always involves the generation of the random event or start signal, to which a profit determination refers. In this case, even if only a few action signals or characteristic signals (or even only one to determine an LTO number), which are in the correct time before the random event (eg S> = REF), or start signal, for the determination of actually pulling random number must be considered, the number drawn from this number will be a very long time to the other who te, for example, determine the rotation to be carried out at the next draw to be able to continue to determine from this series, by cyclic swapping from this series then the temporal rotation of the program proper determination of those participants takes place as many of their own numbers in the drum to choose from.

Example: They are e.g. 512 action signals (identification signal) in the buffer memory of e.g. 32768 memory locations as a group of their preferred choice of their lottery numbers stored, with the serial numbers 103.045.670; 12; 45003020; ...etc. from the numbers of all participants (if the participants of the Counted by number become). To form each group of 512 participants, the As far as possible her numbers in the lottery ticket for a short time in the lottery drum to be displayed, the serial numbers will be displayed the at the previous draw with drawn 512 participants after a freely configurable key converted, e.g. Addition of 1, etc. and the doubly resulting Numbers (because already existing) by the according to the count next, yet not considered replaced, etc. until all participants are through, hired by 512 of course even only 16, etc. participants can each form a group, at as possible all your checked lottery numbers for a moment to choose from stand. The fundamental Sequence of 512 participants was randomized at the Draw a LTO number pulled along, as already explained.

This was just an example to show that for the expansion of the invention according to the principle that parameters, which influence a draw sustainably, in the previous draw or in several previous draws, each with an LTO Number can be dragged with and virtually any number of options exist, to perfect this method and to make the procedure more detailed. It is evident that for the first Game, or the first draw of a number still no parameter previous draws exist, these are then for the first Number of a multitude of lottery numbers to be drawn, by a random number generator generated in the computer software (only as a start condition).

attacks on the server. Because the security structure on the Internet trained the same way is how the Swiss Ementaler cheese (at the holes should you recognize it), is also this procedure by attacks on the Server is not immune. Such robot attacks can do that Change random result, but never predict it in favor of any participant. More is not required here.

7 Fig. 4 illustrates, in a pulse scheme as in summation of the sum value S, alternately alternating even ("G") and odd ("UG") numbers which, when used in the illustrated examples of a likelihood switch, for each of the two paths controlled by the switch (Fig. alternatively occurring random events) would give a probability of 50% and 1: 1, respectively, according to a summation (S) test ratio of 1: 1 (normalized to a temporally linear increment of S, the time scale into the statistical Probability does not come here). By means of a corresponding divider evaluation circuit, which can be emulated (or simulated) via software, we obtain a probability deviating from a test ratio of 1: 1 corresponding to the signal Q or Q shown! for controlling the paths of alternatively arriving random events. In this case, two UG / G signal periods over a period of this signal accounts for the status Q and a UG / G signal period to the status Q! (here stands for the complementary state of Q) which results in a test ratio of 2: 1 with the corresponding probability (normalized to a temporally linear incrementation of S, the time scale in the statistical probability does not enter here).

8th shows in a diagram how, after the arrival of the random event or generated start signal (S => REF at time ts), the first 6 action signals (identification signals) designated as winners, designated here by the numbers 1 Time axis are and their associated time values, with which they lie behind the minimum time of tmin = 320 ms in sequence (each by the specified time value before the previous action signal). The first action signal 1 is 10 ms behind the 320 ms of tmin, ie 330 ms behind ts. The second action signal 2 is 25 ms behind the first action signal 1, etc, ... This diagram is displayed to the participants and serves as a protocol. The action signals 1... 6 are assigned to the subscribers who have sent these action signals (identification signals) to the server in a table that can only be viewed by the parties concerned.

• – zur Erzeugung eines Zeitpunktes nach dem Zufallsprinzip,
• – und/oder zur Erzeugung einer Zufallsauswahl unter mehreren Teilnehmern,
• – und/oder zur Erzeugung einer Zufallsreihenfolge unter mehreren Teilnehmern,
• – und/oder zur Erzeugung einer Zufallszahl (gegebenenfalls auch einer Zahlenreihe, etc.) aus einer entsprechend vorgegebenen Zahlenmenge,
• – und/oder zur Erzeugung einer Zufallsreihenfolge aus einer entsprechend vorgegebenen Zahlenmenge.

mit den besonderen Merkmalen:

• a) daß über eine Vorrichtung die Feststellung der Reihenfolge des zeitlichen Eintreffens von Aktionssignalen (Kennsignalen) in Bezug zu einem Zufallserreignis (Startsignal) erfolgt, welches mehrere Teilnehmer durch Absendung dieser Aktionssignale (über ihre Endgeräte) über einen dem Zufallsprinzip entsprechenden Algorithmus, welcher die Aktionssignale in der Vorrichtung verarbeitet und das Zufallserreignis erzeugt, über die Summenwirkung, bzw. über das Zusammenwirken aller von den Teilnehmern an die Vorrichtung abgesendeten Aktionssignale (Kennsignale) herbeiführen,
• b) daß die Erzeugung eines Zeitpunktes nach dem Zufallsprinzip durch das unter a) genannte Verfahren erfolgt,
• c) und/oder daß zur Erzeugung einer Zufallsauswahl unter mehreren Teilnehmern die Feststellung der zeitlichen Reihung der Aktionssignale (Kennsignale), bzw. der ihnen zugehörigen Daten zum Zeitpunkt (tref = ts) des unter a) eintreffenden Zufallserreignisses (Startsignal) oder zu einem zu diesem Zeitpunkt (ts) in Bezug gesetzten Zeitpunkt (tref = ts – tmin) in Bezug zu ihrer zeitlichen Blähe zum Zufallserreignis bewertet wird (z.B. Bewertung durch Ereignismessung und/oder über Zeitmessung),
• d) und/oder daß zur Erzeugung einer Zufallszahl (gegebenenfalls auch einer Zahlenreihe), den in die Vorrichtung von den Teilnehmern eingegebenen Aktionssignalen (Kennsignale) jeweils eine Ziffer oder Nummer oder auch die unmittelbare Adresse (Bezeichnung) der Teilnehmer als Data zugeordnet ist, welche der zu erzeugenden Zufallszahl entspricht, wobei durch das (oder die) unter c) bewertete Aktionssignale) die Auswahl der jeweils zugeordneten Data bzw. Daten als aus der Gesamtmenge aller zur Auswahl stehenden Daten vorgenommen ist,

mit den weiter genannten Ansprüchen als weiterführende Ausgestaltungsmöglichkeiten der Erfindung beispielsweise
mit den weiteren Merkmalen:

• e) daß das Verfahren in folgender Weise für die Ziehung von Lottozahlen verwendet wird:
• – der Server weist den Teilnehmern jeweils Zahlen zu, die in der Menge der verfügbaren Lottozahlen enthalten sind, und die als Daten zu den von den Teilnehmern (bzw. deren Endgeräten) abgegebenen Aktionssignalen (Kennsignalen) in den genannten Pufferspeicher des Servers (mit) eingeschrieben werden,
• – die den Aktionssignalen (Kennsignalen) zugeordneten Lottozahlen werden anstelle der Teilnehmeridentifikation bei Eintreffen des Zufallsereignisses als erzeugte Zufallszahlen) gewertet, um die nach dem Zufallsprinzip ausgewerteten Lottozahlen zu bestimmen.

The present application relates to a development of the invention according to the claims 67 and 68 using a method

• - to generate a point of time at random,
• And / or to generate a random selection among several participants,
• And / or to create a random order among several participants,
• - and / or for generating a random number (possibly also a number series, etc.) from a corresponding predetermined number of numbers,
• - and / or for generating a random order from a corresponding predetermined number of sets.

with the special features:

• a) that via a device, the determination of the order of arrival of action signals (identification signals) in relation to a random event (start signal) takes place, which several participants by sending these action signals (via their terminals) via a random algorithm corresponding to the action signals processed in the device and generates the random event, bring about the sum effect, or on the interaction of all sent by the participants to the device action signals (identification signals),
• (b) the time randomly generated by the procedure referred to in (a),
• c) and / or that for generating a random selection among several participants, the determination of the time sequence of the action signals (identification signals), or the data associated with them at the time (tref = ts) of the random event (start signal) arriving under a) or at this time (ts) related time (tref = ts - tmin) is evaluated in relation to its temporal blindness to the random event (eg, evaluation by event measurement and / or timing),
• d) and / or that for generating a random number (possibly also a number series), in the device of the participants entered action signals (identification signals) each have a digit or number or the immediate address (name) of the participants is assigned as data, which corresponds to the random number to be generated, wherein the (or the) evaluated under c) action signals) the selection of the respectively associated data or data is made as from the total amount of all available data,

with the further mentioned claims as a further embodiment of the invention, for example
with the further characteristics:

• (e) that the procedure is used for the drawing of lottery numbers in the following way:
• - The server assigns the participants each numbers that are included in the amount of available lottery numbers, and as data for the votes of the participants (or their terminals) output action signals (identification signals) in said buffer memory of the server (with) become,
• The lotto numbers assigned to the action signals (identification signals) are counted as generated random numbers instead of the participant identification when the random event occurs, in order to determine the randomly evaluated lottery numbers.

As already stated in the preceding part of the description, the new random number generator in an interactive lottery draw, or too a raffle, etc., or even for simple selection games, when it comes to playing the participants against each other to select one or more winners at random. In which exclusively the behavior of the participants determines the game, this absolutely safe and not manipulatable by robotic attacks.

The technical task of this embodiment of the invention, the number of participants loading the server during the game to reduce while maintaining the random principle; but with any arbitrary high number in the random event with involved participants. In training, while several Participant groups (see later B and J) through the preferred game, even across multiple games networked and together as winners (e.g., winner pairs) via the interactive stake the participant is "pulled" or determined as the winner can.

These technical task was done by putting forward a preselection procedure solved, which does not adversely affect the randomness of the subsequent game affected.

Thereby reduces the number of participants in the actual game Participants, which has the advantage to extremely high number of participants the game too over to enable low bandwidths better. Respectively. by involving several groups of participants (see later B, J) further differentiated design options of the game are.

The solution of the technical problem corresponds to claim 1, are specified in the method steps to reduce the number of participants of the game, without the random principle be disadvantageous is influenced.

in the Principle could the solution The task specified technical means also with others Competitions are used, which is why for the training described here in addition to the training function to a game according to the previous explanations, still for independent protection in conjunction with any other game in which a variety Participants are interactively involved.

the inventive preselection method comes next a known approach, which as an interactive "casting" (selection) method is known, in which an interactive voting jury (as a participant a set J) of a variety of candidates (as participants a quantity of applicants B), which e.g. on TV in a competition stand each other, like singing, etc., over an automated telephone Vote in their opinion the best candidates.

there it is natural close, and it is also common that ones People from the audience who joined the jury (as participants a lot of J) and which the winner of the competition (from the set B) selected have, by a gamble can compete with each other in another competition one or more winners (from the set J)

Next the usual simple procedure of a drawing by lot, that is suitable after previous explanation trained procedures especially good, in addition to the winner of the competition (from the crowd B) one more winner with interactive participation the participant (from the set J) to determine. The random number generator can do this of the method still be used to a pair Assignment of the winner from the set J to the winner of the competition (from the crowd B) to meet, doing so by networking multiple games with delivery the result Paramter of a game in the next game, in preferred Continuing education is made.

This Invention goes over this simple, the usual State of the art casting (selection) procedures far (which further participation in a game of chance among the participants affects), and reduces the amount of ultimately participating in the game Participants without the superior Prinizip for generating a random event to adversely affect.

there is here again so proceeded that the disadvantage of the specified easy casting (selection) procedure, which is in terms of susceptibility to tampering very vulnerable would be avoided becomes. A possibility to manipulate It's already interactive given votes, which one candidate (from the set B) awarded be, could be recruited, etc. Therefore, by an inventive step to fulfill the technical task, preselection as automatic Method should be designed to the above-mentioned applications continue to match the game, and the preselection likewise not to be manipulated, or at least manipulated to complicate.

To the terminology of the following Part of the description:

The Gambling, which of the large number of participants determines the winner last, e.g. using an interactive random number generator or another similar game will become simple in the following Called game.

The Participants are still commonly referred to as a set consisting from a first set S (e.g., contestants, etc.), from which the winner or a shortlist (selection) by the participants of the second set J (as a jury, each with interactive Vote) is selected according to the majority principle. However, this will Procedure through complex measures so improved that the advantages mentioned above compared to the usual selection process for the specified Purpose.

to Applicability of the procedure: These are the same possibilities given as already stated, particularly preferred are again Internet and TV.

The one used for preselection new procedure has the following special features:

Organization of the participants:

• a) the participants are grouped in two sets, a first set B and a second set J;
• b) where the group formation of the amounts (B, J) by arbitrary Categories, or in the free choice of participants can be made. For example, depending on the application, divided into a first set B of candidates, or candidates from which a winner or a selected group of candidates by giving the votes of all voting members Participants from the second set J are selected or nominated;

These Organization of participants corresponds to the starting conditions according to the state of the art.

Procedural steps for preselection:

• I) every participant from the first set B (eg from the candidates, or applicants, etc.) selects each the second set J has a certain minimum number (e.g.,> 1000, or> 1500, etc.) associated with it Participants out, with the minimum number also exceeded may be and one participant from the crowd J also several participants from the set B can be assigned. However, this mapping will only at the end of the Notified to the participants (both sets B, J), respectively Only then will this assignment be used in the procedure made.

• II/III) die Teilnehmer der zweiten Menge J wählen nach dem Mehrheitsprinzip bzw. Casting (II) und/oder durch ein alternatives Spiel, bzw. (III), einen Gewinner (G_von_B) oder eine Gruppe von Gewinnern aus der ersten Menge (B).

Example: There are, for example, 5000,000 subscribers in the set J, from which the subscribers from the set B (of which, for example, 322 are present) each have at least 1500 subscribers to choose freely. How the selection is done by the participants from the set B depends on the particular application, for example also by clicking on numbers randomly assigned to the individual participants from the set J, or on data belonging to the participants of the set B be made accessible to the participants of the set J so that each individual participant from the set B can make the appropriate individual selection from the set J. On the Internet, the selection is made via standard buttons and menu bars, via TV eg by confirmation via telephone, etc. Also, the game can be combined in part via the Internet and partly via telephone + TV.

• II / III) the participants of the second set J vote according to the majority principle or casting (II) and / or through an alternative game, or (III), a winner (G_von_B) or a group of winners from the first set (B ).

Next the simple prinizip, a winner (G_von_B) from the first Quantity B by the participants of the second set J according to the majority principle choose directly, is still the possibility a training option preferred in which among the alternative Use of a game in which the participants of the second set J interactive play, an interactive drawing of Numbers exclusively takes place at random, as already in numerous embodiments for a Lotto or raffle game explained has been.

Before holding this game (in step III, 1 ), the participants of the second set J have, according to the majority principle, selected or nominated a preferred group of participants from the first set B (as candidates) (in step II, 1 ). These subscribers of the first set B remaining from the preselection selection, which are furthermore designated as belonging to the remainder set_B, are assigned numbers that are set by the subscribers of the second set J in a game following the preselection selection.

• – Die genannte Weiterbildung betrifft daher auch die Vernetzung zweier Mengen von Teilnehmern; hier die Vernetzung der zweiten Menge J einer interaktiv eine Vorselektion vornehmenden Jury und der Restmenge_B, welche von dieser Jury in dieser Vorselektion aus der ersten Menge B ausgewählt wird. Diese Vernetzung wird dadurch vorgenommen, daß die in dem Spiel (in Schritt III, 1) durch interaktive Teilnahme der Spieler aus der zweite Menge J gezogenen Zahlen, welche von diesen Spielern (der zweiten Menge J) jeweils frei gewählt werden können, zur individuellen Bezeichnung den Teilnehmern aus der Restmenge_B vor Beginn des Spieles frei zugeordnet werden, wodurch im nächsten Spiel, dem Endspiel (in Schritt IV, 1) jeweils Gewinnerpaare bestimmbar sind, wie nachfolgend zu 1 in einem Beispiel noch näher erläutert wird.

In the game (in step III, 1 ) then those participants from the Restmenge_B are drawn as each corresponding to the set numbers of the winner of the game from the second set J, according to the already explained for a lottery draw or raffle Prinizip. Where either only a winner from the second set J is determined, or a ranking of several winners is determined with the appropriate number, or ranking of numbers drawn, which correspond to the winners from the rest Menge_B (see also 1 ).

• - The training mentioned therefore also concerns the networking of two sets of participants; Here the networking of the second set J of an interactive preselection jury and the remainder set_B, which is selected by this jury in this preselection from the first set B. This networking is done by placing in the game (in step III, 1 ) by interactive participation of the players from the second set J drawn numbers, which of these players (the second Quantity J) can be chosen freely, for the individual designation, they are freely assigned to the participants from the remaining quantity_B before the start of the game, whereby in the next game, the final (in step IV, 1 ) winner pairs can be determined as follows 1 will be explained in more detail in an example.

To the previous example: in a first step are of the 322 participants from the crowd B, the best twelve by the 5000,000 participants from the set J according to the simple majority principle as remainder B nominates (i.e., the remaining 310 excluded), and then the 5000,000 participants of the crowd J, each of these remaining 12 participants (the remainder B) a particular participant through the preferred game over that brought about interactive random event as the winner of the game, or even a Ranking of multiple winners, according to the method specified above.

• IV) Angaben zum Endspiel: aus der zweiten Menge (J, bzw. hier der Jury) werden nur jene Teilnehmer zum Endspiel zugelassen, welche sich in der in Schritt I) ausgewählten Menge (als Zuordnungsuntermenge von J) befinden, die in Schritt I den der Restmenge B zugehörigen Gewinnern G_von_B (bzw. gegebenenfalls auch nur einem Gewinner) individuell zugeordnet worden sind. Diese zum Endspiel zugelassenen, und durch die zugehörigen Gewinner G_von_B im ersten Schritt I, d.h. vor Beginn des Spiels, jeweils sich selbst zugeordnete Menge von Teilnehmern wird nachfolgend als Zuordnungsuntermenge von J bezeichnet.

In the variant after 1 is to the previous game (with the interactively induced random event), which is here to be referred to the distinction as a first game, another game provided, which should be referred to here as a final distinction. The formation of winning pairs is not done in the first game, as it would be possible, but only on the further game, ie on the final (in step IV, 1 ), in such a way that the actual winners of the interactively played first game (in step III, 1 ), but only the corresponding numbers set by the winners (as in a lottery game) or subscribers corresponding to those numbers from the remaining quantity B (hereinafter also referred to as G_von_B) are taken over into the subsequent final game. These winners were only required to determine the number or numbers that designate the winner (s) G_von_B from the remainder of B. That is, in the Prinizip exactly the same technical procedure for the game is used, as it has already been described for the lottery or raffle game.

• IV) Information on the final: from the second set (J or here the jury) only those participants are admitted to the final, which are in the set selected in step I) (as a subset of subordination of J) the remainder B associated winners G_von_B (or possibly even only one winner) have been assigned individually. This set of participants admitted to the endgame and allocated by the respective winners G_von_B in the first step I, ie before the start of the game, is referred to below as the assignment subset of J.

Pairing the winner in the final:

In this variant, the pairing of winners takes place only in the final. If in each game (ie in the first game and in the final) only one winner, or winner pair provided, then the assignment is easy. If several winner pairs (eg ranked according to first place, second place, third place) are provided, then the assignment can be made according to matching assignments and priorities, such as 1 in an example will be explained in more detail below.

In addition to the following in 1 in principle, the two options exist, either from the first game or from the second game to derive the ranking, in both cases then from the taken in step step I, the pairing of the winner or a number of winners can be made.

1 illustrates an embodiment, which can be played on the Internet or on TV as training for the preferred lottery tombola game.

The Number of candidates 1 ... n in this example is 322 and applies the set B. The set J concerns the interactively participating jury, whereby e.g. 5000,000 people participate as jury to one via Internet or to rate the performance of the candidates on TV.

In this example, in the first step, each candidate (eg a singer contest, a Miss choice, etc.) from the set B is assigned at least 1000 jury members from the set J. This process can be done only randomly, or even by the candidates (the set B) are made individually, for example, by priorities (music genres, etc.), which the jury members of the set J also over the Internet, for the candidates of the set B clearly visible. In 1 are only for four out candidates from the set (1 ... n = 322) the assigned jury members of the set J also shown and associated with Yes (1200), Jb (1000 assigned), Jc (1100 assigned) and Jd (1400 assigned).

The Assignment takes place for the jury members of the crowd J anonymously, ditto for each other candidates of the crowd B. It can also be the same Jury members of the crowd J also several candidates of the crowd B be assigned.

in the 2nd step can the members of the jury (that is all participants from the crowd J) against Payment of a small entry fee the nomination of their opinion for best candidate (or candidate, etc.) via the Internet or by number input via telephone (at TV presentation of the candidates) the usual majority principle (to determine the chart of candidates). there In addition to specifying a fixed value (e.g., 12), the number the candidates to be determined are also determined dynamically by e.g. a minimum percentage, or certain relative proportions of Voices that reach the selected candidates have to, to be included in the group of choices (here twelve). These twelve remaining here Subscriber from the set B is referred to as selected remainder B.

in the 3rd step can all jury members (or all participants of the set J) at one first game, which after the prinizip of the already proposed Lottery raffle game technically implemented. The better overview because of the absolute addresses (3, 32, 87, 23, ... 120, 78) the 12 best candidates nominated by the participants in the second step (corresponds to the selected residue B) in a numerical order with the step size one (= 1, 2, ... 12) recoded and so the (participants the amount J) is displayed. Furthermore, this is paid in the first step Entry fee as credit (for the Money bag of the game, cf. previous explanations).

In In the game, the participants of the set J each on the number (from 1 ... 12), which each have their personal favorite (from the Series of the remaining candidates 1 ... 12, or from the selected remaining quantity B). It is for this example provided to evaluate the top three places, taking as Result (OUTPUT) of the game the digits 7 (= first place), 4 (= second place) Place), 9 (= third place) are received, respectively Describe candidates from the selected residual quantity B (from 1 ... 12). there In the first step of the procedure the candidate 230 (who after the numerical ranking within the remainder B the number 7 assigned the participants were assigned to the amount Yes (from the set J), the Candidate 4 (formerly 23) has assigned participants from the crowd Yes, and the candidate 9 (earlier 12) has assigned the participants from the set Jc. Designate the quantities here do not represent absolute quantity limits but symbolize them Here only the indication of which participants from the crowd J, which is drawn from the selected residual quantity B (from 1 ... 12) Participants have been assigned in the first step of the procedure, reduced to the selected in step 2 residual B from the through this game the three participants 7, 4, 9 as a series of G_von_B have been drawn from the residual quantity B.

at In this game, the actual winners are not important but only the "pulled" winning numbers (as Sequence of G_von_B), here 7, 4, 9 from the selected remainder B (from 1 ... 12) to which the winners are placed before the start of the game to have. These winner numbers (7, 4, 9) refer to the ones stored in step 1 Reference (or a pointer) to each in this step assigned participant of the crowd J (jury). By scanning all assigned entrants become eligible for the following Endgame determined.

For the number 7 from the selected remainder B these are the participants of the Quantity Yes, for the number 4 from the selected remainder B these are the participants the crowd Yes, and for the number 9 from the selected remainder B these are the participants the crowd Jc. Those Eligible from the set J will be considered as Assignment subset of J denotes.

In the 4th step, the participants of the subset of J (= Yes, JaxJc, and Jc) determined at the end of the 3rd step can participate in the interactive endgame. By further direct payment of participants while the content of the bag is further increased. In 1 is the only winner of the game # 721, which belongs to the lot of Ja. In this case, a pointer stored to the subscriber # 721 (from the set J) during the assignment in the first step refers to the subscriber 7 (previously 230 from the set S) and furthermore also to the subscriber 4 (previously 23 from the set B) , here symbolically marked by a lot of Yes. Which of the two participants from the set S, or from the sequence G_von_B of the selected remainder set B, is used for pairing the winner pair, decides the ranking of the result in the first game. Since the 7 stands before the 4, the 7 is assigned here as another winner (or the participant 230, which corresponds to this number). It is immaterial whether the 7 is in the first place, it must be in this case only 4, whose participants has the same assignment to the participant # 721. How the ranking is determined has already been described in detail.

In other words, for the variant in which only one winner (from the set J) is allowed in the final game, but in the previous game a ranking G_von_B of the selected remainder B, ie several ranked winners are allowed, this ranking is used to determine the selection of the Winner from the set J used by the assignment made in the first step, if the winner (in step 1) have been assigned several participants included in the ranking G_von_B the selected remainder B, in which case, for example, the highest ranking participants from the rank G_von_B the winner (from the set J) of the final is assigned as another winner. In this example, therefore, the winner of the endgame, # 721, is assigned the participant 7 from the selected remainder B or = 230 from the set B, respectively. For example, in this team-oriented game, the money received is divided into three thirds, one third for the winner of the final, # 721, and the third for the participant 7 from the selected remainder B (or = 230 from the set B) and the third third for the operator of the game. It is evident that several winners can be admitted for the final game, whose assignment of a winning partner (to form a pair) is then carried out according to the assignment made in step 1.

Further Special features of the system: the server or one served by it another server, has a preprogrammed by time intervals Self-shutdown on, which only by (in each case on time) Updating a submitted and tested Codes can be made ineffective in time, until the arrival the next Time interval, before the next one Code (checked according to table) to prevent self-shutdown sent to the dairyman must become.

© further applies to the explained Training according to claim 67 or 68, as for the random method according to the claims 1 to 66, the precautionary claim of the Copy Rights by the Register for the details given here on the date of the first application of the patent application (regarding the internal priorities used) German Patent Office.

Claims (68)

Method - to generate a time randomly, - and / or to generate a random selection among several participants, - and / or to generate a random order among multiple participants, - and / or to generate a random number (possibly also a number series, etc. ) from a corresponding predetermined number set, - and / or for generating a random order from a corresponding predetermined number of sets, characterized in that a) that the determination of the order of arrival of action signals (identification signals) in relation to a random event (start signal) via a device takes place, which several participants by sending these action signals (via their terminals) via a random algorithm that processes the action signals in the device and generates the random event on the sum effect, or on the interaction of all of the participants (c) and / or that, in order to generate a random selection among a plurality of subscribers, the determination of the time series of the action signals (identification signals ), or the data associated with them at the time (tref = ts) of the random event (start signal) arriving at a) or at a time (tref = ts - tmin) related to this time (ts) in relation to their temporal proximity d) and / or that in order to generate a random number (possibly also a number series), the action signals (identification signals) entered into the device by the participants each have a digit or number or the immediate address (name) of the participants is assigned as data, which to generate the The random number corresponds to, wherein the (or the) evaluated under c) action signals) the selection of the respectively associated data or data is made as from the total amount of all available data. Method according to Claim 1, characterized in that, in determining the sequence or time sequence in which the action signals (identification signals) associated with the participants occur immediately before the random event (start signal), a defined time interval tmin is subtracted from the time of the random event in order to determine the time sequence a respective action signal must be before the time of the random event to still valid (within the time series used for the evaluation). Method according to one of claims 1 or 2 or in its own Application (e.g., in conjunction with claim 62) characterized that (mentioned) Action signals (identification signals), which by the participants each be delivered to the device, in their cumulative effect, or on her Interaction a value S influence so that he is a reference value REF is approaching and that at his reaching the said accidental event, to which itself the order or the time measurement of the action signals (characteristic signals) or the generation of a random time, is generated as a reference signal (start signal). Method according to claim 3, characterized that the influenced by the participants Value S by summation of summands (which may also be have a negative sign), to each delivery of an action signal (Kennsignales) of a participant are added to the current sum S and thus an increasing (or possibly also falling) signal, or a corresponding Value S, which upon reaching the reference value REF the called random event (start signal) generated. Method according to one of claims 1 to 4, characterized by the following means and method steps: I) it's the following Agent used: - one Networking of input terminals or input devices (IT-networked computers, Browser stations, telephones, mobile phones, also locally networked measuring stations, etc.) with a device used as said device for carrying out the method Computer (for example, server or other networked server, data center etc.) or a similar device (DSP circuit, etc.), the (the) on the network input devices, or about the from the input devices obtained data generates the random event according to claim 1, wherein the following algorithm which the action signals in the device processed, and continue II) the following process steps used are: a) by the said action signals (characteristic signals) from the input devices the computer transmitted data are summed by the software of the computer (server) (S), where the algorithm for the summation (S) of these values, if necessary, by a corresponding Formula in continuing education can be freely designed (like multiply the result by a constant, or multiply the summand of a constant, also generating a nonlinear Function with flattening when approaching to the reference value REF, etc.); b) that of the input devices the Computer (server) transmitted Action signals (identification signals), or their data are with a buffer memory (the computer, or server, or a similar device) according to their temporal occurrence constantly cached, or updated (e.g., LIFO, last in first out), so that to at any given time the received action signals respectively associated Data according to their chronological order (as stored from this cache in one of the memory capacity of the cache corresponding number in the order or determining the order can be read out as at the time of said unpredictable random event immediately before this event (in the corresponding temporal Sequence) occur; c) a reference value REF is specified, the at the mentioned summation of each result obtained (S) must be achieved (e.g. S => REF, or if necessary also S = <REF) to obtain said random event (start signal); d) upon detection of the occurring random event (start signal) the caches referred to in paragraph (b) are buffered Data in the server (or similar device) received action signals (identification signals) for the evaluation of the random event, or read out to form said random number. Method according to claim 5, characterized in that that the cached data in said buffer (the in the server received action signals, or characteristic signals) at least one Data related to the following data: - those from a time counter at Arrival of the participants respectively issued identification signals read time values (t1, t2 ... tn), - the identifier (name identifier, or address) of an input terminal or input devices respectively serving subscriber, - one Lotto number or comparable number (tombola stupid, etc.), which by random selection of the action signal, - Further Numbers that continue to control the process and as a random number also be drawn (e.g., the time tmin, Etc.). Method according to claim 5 or 6, characterized that the cached data in said buffer (the action signals received in the server) from a time counter on arrival read the issued by the participants each characteristic signals Relate to time values (t1, t2 ... tn). The method of claim 7 with claim 2, characterized characterized in that Process step d) of claim 5, the time ts of occurrence the random event (start signal) according to the count the (referred to in claim 7) time counter is stored and deducted from this value, the time period tmin mentioned in claim 2 and that in Reference to the value obtained from this tref = ts - tmin when reading the in the buffer cached data in the server received action signals (identification signals) for the evaluation of the random event, only the data of those action signals for the formation of said Order are used to evaluate the random event, their time values (t1, t2... tn) related to the value tref, or the resulting time differences tref-t1, tref-t2, tref-t3 ... tref-tn, still give positive values, or the these time values (t1, t2 ... tn) associated Action signals (or their data) before the time tref = ts - tmin have arrived in the server for processing. Method according to one of the preceding claims, in particular Claim 8, characterized in that the evaluation of the random event or the found random number (possibly also several Numbers) of the ranking of the corresponding participants according to the Sequence of the time of arrival of their action signals (identification signal) in the server, with the ranking of the action signals associated with the winners (Identification signals) starts at the action signal, which of all others Identification signals to the mentioned (on the random event related) time tref (= ts - tmin) temporally closest is and that the The main winner of those participants is their action signal within this series for a certain number of winners from that time tref (= ts - tmin) temporally closest is, or the lowest profit concerns those participants whose Action signal within this series this time tref (= ts - tmin) farthest away, Method according to one of the preceding claims, in particular Claim 8, characterized in that the evaluation of the random event or the found random number (possibly also several Numbers) of the ranking of the corresponding participants according to the Sequence of the time of arrival of their action signals (identification signal) in the server, with the ranking of the action signals associated with the winners (Identification signals) starts at the action signal, which of all others Identification signals to the mentioned (on the random event related) time tref (= ts - tmin) temporally closest is and that the The main winner of those participants is their action signal within this series for a certain number of winners from that time tref (= ts - tmin) farthest away, or the lowest gain that participant concerns its action signal within this series this time tref (= ts - tmin) the next is. Method according to one of claims 1 to 10, wherein by the Method according to the random principle in each case one participant selected whose action signal (identification signal) is within the order of time arrival in the server mentioned above (on a random event related) time tref (= ts - tmin) is closest in time (for example according to claim 9 or 10), characterized in that the method is described in following way for The draw of lottery numbers is used: - the server assigns to each participant numbers that are in the set of available lottery numbers contained as data to those of the participants (resp. their terminals) output action signals (identification signals) in said buffer memory the server (with) to be enrolled, - the the action signals (identification signals) assigned lottery numbers are used instead of the subscriber identification upon arrival of the random event as generated random numbers) scored the randomly evaluated lottery numbers to determine. Method according to claim 11, characterized in that that the Lotto numbers, which the players or the participants assigned to the server action signals (identification signals) will match the numbers that players previously had on one Lottery ticket over have entered the WEB page (or clicked on it, ie ticked to have). Method according to claim 11, characterized in that that the Lotto numbers, which the players or the participants assigned to the server action signals (identification signals) be, constantly generated by the server and the participants, or their Kennsignale be assigned and displayed on the computer of the participants or terminals, or if necessary saved. Method according to one of claims 1 to 13, characterized by a probability switch, which after the prinizip of a statistical probability decides whether a game (or a lottery drawing, etc.) for the generation of said random number (possibly also for the production of several numbers) or for production a random selection among several participants, on arrival of the random event (start signal) with that by the random event (Start signal) triggered Evaluation of the random event is decided, and thus the amount corresponding to the reference value REF is paid and the Reference value REF for a new game is reset (or deleted) or whether the reference value REF for a new game is retained and corresponding to the reference value REF Amount is not paid. A method according to claim 14, for the realization of Probability switch, characterized in that by the server itself (as another robot player) action signals (accordingly the characteristic signals) are generated and the said statistical probability through the relationship v is realized, which is the ratio of the received in the server Action signals (identification signals) to those generated by the server itself concerns. Method according to claim 15, characterized in that that this said ratio v the statistical probability is realized by adding each to the server of the participants, or their terminals respectively received action signal (identification signal) within a respective (the respective action signal) The number of times the action signal is received from Server output action signals measured (or evaluated) is and the number of action signals issued by the server to the desired one relationship v (according to the desired Probability) is controlled, such that the statistical distribution the output of the server action signals from the terminals of the Participants each received action signals (identification signal) in this ratio (spread over corresponding time intervals) as far as possible equivalent. Method according to one of claims 1 to 16, characterized that the said reference value REF is reduced in value to the extent that until the reference value is near by the of the terminals the participant respectively received action signals (characteristic signals) summed (or influenced) Value S approaches. Method according to one of claims 1 to 17, characterized that this Procedure with the following optical display is carried out (which can be graphically enhanced in any way): - it is a beam balance displayed, consisting of a bar lever, the has a pivot point between its ends (e.g., in the middle or in the vicinity the center, etc.), around which the balance is moved according to its lever movement (according to her Control by the software) to move up and down; - on one At the end of the bar scale, the reference value REF symbolizes (e.g. Money bag, etc.) of the method a weight against which a on the other counterweight weighing on the end of the balance (G, cf. Monkeys or other figures or coins thrown into a basket, etc.) presses, which from the terminals the participant respectively received action signals (identification signals) summed (or influenced) Value equal to S, resulting from the accumulation of incoming (in the server) Action signals (indicia) approximates the reference value REF; - by the of the terminals the participant respectively received action signals (characteristic signals) by summation occurring approximation, or the degree of approximation the value S (which corresponds to said weight G) to the Reference value REF is (according to control through the software) by the inclination of the bar (or lever movement) symbolically displayed, - in which upon arrival random event (start signal) of the bars around his Pivoting a rocking movement moves up and down accordingly becomes. Method according to claim 18, characterized that the Degree of approach the value S (which corresponds to said weight G) to the Reference value REF in a test ratio a control signal corresponding to the count of the approach inclined beams so impulsively out of this inclination moved that the Violence of the movement and / or the respective Aufsetzdauer the Balkens in the final position corresponds to the test ratio. Method according to claim 18 or 19, characterized that this Counterweight G and said duty cycle generation by at Bar moving figures (e.g., animals, monkeys, etc.). Method according to claim 18 or 19, characterized that the Reference value REF is represented by a money bag. Method according to claims 21 and 17, characterized that the Reduction of the reference value REF is symbolized by rodents (for example mice), which annoy the money bag (with coins rolled out), or from the bar falling money sacks is symbolized. Method according to one of claims 1 to 22, characterized if necessary also an increase the reference value REF is made, which by further (auf the bars falling) money sacks is symbolized. Method according to one of claims 1 to 23, with use said reference value REF for the generation of the incoming Random event (start signal) and use of a probability dip according to claim 14, characterized in that the reference value to a predetermined time window (for example, by time), within the reference value is reached by said summed value S must become, to obtain said switching signal, wherein if within the limited by this time window period no switching signal is received, the process is restarted if necessary. Method according to one of claims 1 to 24, characterized that the to the participants (via their terminals) Action signals sent to the server (identification signals), in each case a fee a phone call corresponding data containing by detected the server and are used to form said accumulated value S. Method according to one of claims 1 to 24, characterized that the to the participants (via their terminals) Action signals sent to the server (identification signals), in each case one over A telephone call will be accompanied by code corresponding to a payment is derived, with the monetary values corresponding to the payment detected by the server and are used to form said accumulated value S. Method according to one of Claims 17, 21, 22, characterized that too any reduction of the reference value REF, a sufficient excess of the for the counterweight to the reference value REF on accumulated amounts S available is, where for the summation of the value S only a corresponding fraction (Proportion) of the paid-in amounts is used and the remaining amount as profit and for financing the reduction of the reference value REF is used. Method according to one of claims 1 to 27, characterized that for the transmission of the action signals (identification signals) next to the (further) possibility to use an internet connection using a telephone connection which, if appropriate, uses subscriber identification by an assignment code, wherein as a start signal or identification signal a corresponding sound message (e.g., "GO"). Method according to one of claims 1 to 28, with use said reference value REF for the generation of the incoming Random event (start signal) and use of a probability dip according to claim 14, characterized in that the sum S of the over sums summed up by the participants dS summed sum S is formed so that in the summation of the individual summands alternately even and odd values of the sum S and that over the Decision whether at the time of the random event in which the sum S intersects (e.g., exceeds) the reference value REF S> = REF), associated occurring Value of the sum S is even or odd, decided is whether a game ended (and the profit paid or the reference value REF is reset) or whether the game continues and the reference value REF is maintained, or if necessary increased. Method according to claim 29, characterized that one Divider circuit, or a divider circuit corresponding divider Function is provided which by the summed sum S corresponding divider ratio between even and odd numbers of 1: 1 in one Deviating ratio to change the probability divides, or implements. Method according to one of claims 11, 12 or 13 for drawing lotto numbers or similar random numbers, characterized in that the summands dS from which the value or the sum S = n · dS (as reference value to the reference value REF) is formed , the nth part of the amount which will be paid out to the winner (if all the numbers are correct) and the value n divided by the amount to be paid to the winner (maximum), calculated from a factor, derived from the participants participating in the game, the reference value REF being the amount (maximum) to be paid to the winner. Method according to claim 31, characterized in that that the named value n by the winner (maximum) to be paid Amount is divided to get the summand dS, respectively, over the Playing period of regular periods adapted to the current number of players, the addend dS corresponding to these time periods correspondingly is updated. Method according to one of claims 11, 12 or 13 or 31 or 32, to draw lottery numbers or similar at random drawn numbers, where the numbers in several passes (for each number one) and the production for each pass the start signal S> = REF takes place in order to take account of the minimum time (if applicable) tmin the action signal (identification signal) of a respective subscriber select and over the previously assigned to the subscriber before the start signal S> = REF Lotto number to determine this lottery number as a drawn number, thereby characterized in that at each Passing a relevant number is determined, and in the next round the already drawn numbers for an assignment to the action signal (identification signal) of the participants no longer allowed or the participants for the next passages or Drawings are no longer assigned. Method according to claim 33, characterized that one constantly statistical determination (via corresponding regular time intervals) takes place to the distribution of the numbers given to the participants for the game each assigned or get to choose from, so to steer, that, from the each not yet drawn numbers all other numbers from the Quantity of the game, each in equal proportions to the participants of the game are distributed. Method according to one of claims 1 to 34, in particular according to claim 3, characterized in that one independent of the software that determines the method of generating a random number (possibly also several numbers) or to generate a random selection among multiple subscribers, working protocol device is provided, which processes the following input signals: a) the action signals (identification signals) obtained from the network (Internet, etc.) of the terminals the subscriber who decodes as data to be evaluated accordingly are (DEC), b) the sum S summed by the server, c) the current reference value REF used by the server, d) the from the server (according to claim 2) predetermined time tmin, e) and the initialization signal, which is the beginning of the process (or the game) indicates with the sync signals, for synchronization the time measurement, or optionally the memory clock for detection the chronological order of the received action signals (Characteristic signals), and that the Protocol device, the start signal (S => REF) generated independently and the sequence of autonomously detects received action signals (characteristic signals), wherein the results of protocol device and the server together are compared, in which one independent of the cache of the Server provided buffer (e.g., LIFO, last in first out), optionally as with the server with an existing time measuring device is provided, the independent from the server, the chronological order of the received action signals (Characteristic signals), or associated Data, for one of the storage capacity the buffer memory provided number of action signals (identification signals), which before or until the time of generation of the start signal (e.g. S> = REF), stores, or logs, and that a comparison device is provided, which generates the start signal (S> = REF) independently of the server, and the sequence determined to be valid on arrival of the start signal (S> = REF) the data stored in the buffer memory for monitoring purposes with the compared to the rank determined in the server. Method according to one of the preceding claims for use for a lottery drawing or a comparable process, in particular claim 18 with the claim further referring to this claim, wherein the money bag or the reference value REF symbolizes a sum which corresponds to a profit and the summands dS via which the sum value S is summed corresponds to a corresponding fraction of the reference value REF in adaptation to the number of participants, characterized in that (further) a display is provided which symbolizes a lottery drum with the numbered balls floating therein selected by the participant respectively can be or can be clicked to select, with the selected number (corresponding to the ball) when sending the selection signal associated with this signal (identification signal) of a subscriber in the server via averaged data is sent to the server, and that in each case the balls, or their numbers, which at the time of generating the random event (start signal S> = REF) considered to be drawn in the drum are no longer displayed for selection, each pulling by repetition of the game (possibly even with multiple ball selection in a game, each an action signal of a participant is sent to each ball selection) with the generation of the random event (start signal S> = REF) is made. Method according to one of Claims 1 to 36, characterized in that, after delivery of an action signal for each subscriber, a blocking time tw ( 4a ) is provided, which must run, so that the subscriber can repeatedly send an action signal (identification signal), where appropriate, tw controlled by the number of participants. Method according to Claim 36 or 37, characterized in that the action signal (identification signal) is triggered by clicking on a ball or its number in the lottery drum, optionally one of the blocking times tw ( 4a ) corresponding blocking is provided and / or one of said blocking time tw ( 4a ) corresponding delay for the delivery of the action signal (identification signal) takes place. Method according to one of claims 36 to 38, characterized by the following further features for the representation of the lottery drum: a) an output ( 101 ), at which the respective ball drops out, which has been clicked by the participant as a number to be selected, b) an output ( 102 ), at which in each case that ball is ejected and into a collecting container ( 103 ), which is considered to be pulled when the random event (start signal S> = REF) is generated (or the action signal belonging to this number or the identification signal lies outside tmin at the time of the start signal). Method according to one of the preceding claims, in particular according to claim 3, characterized in that the start signal is generated, when the increasing sum S (dS positive) exceeds the reference signal REF (S> = REF) or that the start signal is generated when the falling sum S (dS negative) the reference signal REF exceeds (S <= REF). Method according to one of the preceding claims, in particular according to claim 3, characterized in that by the participants or teammate of a game influenced value S by the game is generated and that the Reference value REF (for example, based on a specific reference value tolerance within a given value) by a random number generator is produced. Method according to claim 41, characterized that the Random generator which generates the reference value REF by a further game (or another drawing process) of the same process formed is random, with each player from the server random numbers be assigned in the area in which the number should be comparable to the mentioned allocation of lottery numbers, where the numbers drawn in order determine the random number to be determined result. Method according to one of the preceding claims, in particular according to claim 2, characterized in that said time value (tmin) is determined by the individual players each from the server random numbers be assigned in the area in which the number should be comparable to the mentioned allocation of lottery numbers, where the numbers drawn in order determine the time value to be determined (e.g., tmin). Method according to claim 43, characterized in that that the to a drawn lottery number (which is determined by the associated action signal, or characteristic signal has been selected by the random principle) (tmin) for the next Drawing process (or for the next generated start signal) as the start signal or random event related time value (tmin) is used, within which the received action signals (or characteristic signals) are not evaluated. Method according to one of the preceding claims, in particular claim 43 or 44, characterized in that from the server the action signals, respectively identification signals respectively associated data (eg time value tmin) from a software implemented outside the server device in hardware and / or within chips (DSP , etc.) and encoded in this recoded form (for control purposes) are made accessible to the method (eg verified by a protocol station and / or the An wender is displayed, etc.). Method according to one of the preceding claims, characterized characterized in that the method a first random event (start signal as a random number generates the reference value REF, via in a subsequent game, the second random event (as second start signal), which play is crucial (e.g. for the purpose of generating a random time, which also to arbitrary can be used for other purposes). Method according to one of the preceding claims, characterized characterized in that Lottery numbers refer to numbers which a catalog of goods or the like be associated with, realized by the method a raffle becomes. Method according to one of the preceding claims, in particular according to claim 43 to 45, characterized in that the same Method, as for given the generation of the random value of tmin, even for others Parameter of the method is performed, e.g. for determination the position of one in a certain number of received in the server Action signals (or Kennsignale) limited series, which at the time (tref = ts) of said incoming random event (start signal) or at a date set at that time (ts) (tref = ts - tmin) in relation to their temporal proximity is evaluated for random occurrence (e.g., evaluation by event measurement and / or over Timing), such that the position drawn in the previous draw for each subsequent one Draw determines the position within this row, which the represents the dragged value (data) (or contains). Method according to one of the preceding claims, in particular according to claim 3, wherein the random event (start signal) is derived from the Determination of the balance (or ratio) of one by the interaction all participants formed (summed) value S to a reference value REF, characterized in that in the process a process is involved, in which of the participants in the Server emitted action signals (identification signals) corresponding (Profit adjusted) monetary value both on the summed value S as is also summed to the reference value REF to the reference value REF increase accordingly. Method according to one of the preceding claims, in particular according to claim 3, wherein the random event (start signal) is derived from the Determination of the balance (or ratio) of one by the interaction all participants formed (summed) value S to a reference value REF, characterized in that in the process a process is involved, in which of the participants in the Server emitted action signals (identification signals) corresponding (Profit adjusted) monetary value to a part on the summed value S and to another part to the reference value REF is summed to to increase the reference value REF accordingly. The method of claim 49 or 50 with a probability dip according to claim 29 or according to claim 30, characterized that the Probability switch does not decide whether on arrival of the Random event (start signal) the game is continued or not, but that the Probability switch decides whether the (profit adjusted) Monetary value of an action signal issued by a participant to the server (Kennsignales) to a part on the summed value S and to one other part is summed to the reference value REF to the reference value Increase REF accordingly or summing only the summed value S. The method of claim 50 or claim 51, characterized characterized in that Distribution of the (profit adjusted) monetary value between the summed up Value S and the reference value REF each in equal proportions. Method according to claim 52, characterized in that that with the excess resulting from this division for a probability switch according to claim 15 or claim 16 generated by the server (free) and also summed to the accumulated value S action signals, which thus correspond in monetary value to a loss compensated will be (or financed). Method according to one of claims 1 to 53, characterized in that the terminals of the participants (client computer, browser computer) for each output action signal (identification signals) in the terminal each start a (self-sufficient) timing, which determines the period of time from the output of the identification signal until the message from the server that the random event (start signal ts) is possibly generated, this measurement being carried out for each newly issued action signal (identification signals) and for the measurement results in Terminal of the subscriber is a buffer memory (FIFO, first in first out) is provided which stores as many action signals (identification signals) of the subscriber between, as the subscriber can deliver action signals within the maximum Zeittdauer of tmin according to claim 37. Method according to one of the preceding claims, in particular according to claim 3, characterized in that the terminals of the participants for delivering the action signals (identification signals) to the server, a function input to the incremental change of the reference value REF in both directions (see button: "increase profit" and "reduce profit") and that the triggering for Output of an action signal (identification signal) to the server via this Function input takes place. Method according to one of the preceding claims or in own application, whereby a number of numbers are drawn, e.g. a lottery draw, raffle draw, etc., and several draws (one number each to determine a number sequence) are characterized in that the number drawn with each drawing process within a randomly determined one Row is located and the position of the dragged number within this Row by the previous drawing process as a random number to drawn number is drawn with the number drawn by the Randomization of a series of numbers or numbers, with finite, predefined number of numbers, which consists of a long stream of numbers with undefined number over the current draw is determined by chance and a position number, which was drawn by the previous draw each with and determines the position of the number within the row, thus a nested one Draw (draw in the draw) is made. Method according to claim 54, characterized in that that there the server does not send the start signal to all participants at the same time (as real-time data information) can continue to be provided is to send the participants correction times from the server, which compensate for these time differences, so that in the computers of the participants determined results with those measured in the server within the according to the planned temporal resolution, or, if appropriate, with the transit times measured in further protocol devices. Method according to one of the preceding claims Application for a drawing of numbers from a set of numbers through the action signals (Identification signals) of the participants respectively assigned numbers, or a number assigned to each participant by the following filter measure: - become at the same time different numbers of several players through at the same time in the server incoming action signals (identification signals) pulled, then these are at all not rated and for that the number one of the definition for the time sequence corresponding to the following action signal evaluated as drawn, either at that time has only one characteristic signal or even several characteristic signals, however with the same number (as assignment). Method according to one of claims 1 to 58, characterized that the randomly generated time value (ts) or the named Relative timing (tref = ts - tmin) is crucial to the game Signal for another (random) game is used (on the same Server or on a networked other server, etc.). The method of claim 59, or after one of previous claims or in their own application, the randomly generated Time value (ts) or the time referred to above (tref = ts - tmin) As a game crucial signal to another server over a IT connection transmitted is, this transmission by a corresponding code (data), characterized that one constant transmission the data to the other server for the purpose of measuring transit time of the signal (in relation to a common absolute timepiece of the Server, which is synchronized by a radio clock if necessary, etc.) is provided and from the differently obtained maturities the mean value is formed from which a correction variable for the term of randomly generated and transmitted to the other server Date is derived. Method according to one of claims 1 to 60, in particular according to claim 37, characterized in that upon detection that a subscriber too high (temporal) density of action signals (characteristic signals) sent to the server, the processing of these signals in the server and / or in the client computer of the subscriber (via an additional software) renewal the minimum break time tw to be maintained is reduced. The method of claim 3, wherein the method is modified as follows, characterized in that said action signals within a game correspond to the participants associated weights chen (eg controlled by IT networked participants), on the one hand by the participants each affected (by indirect inputs, etc.) on the other hand are influenced by the game and in their cumulative effect, or on their interaction (in the game) a value (Sum value S) influence so that it approaches a reference value REF and that when it reaches the said random event, to which the generation of a randomly arising point in time, as a random signal (corresponds to said start signal) is generated. Method according to claim 62, characterized in that that the Reference value REF by according to the method of claims 1 to 61 drawn random numbers is determined, where the number also composed of several drawings, which are separated by time can. Method according to claim 62 or 63, characterized that by the generated random signal (corresponds to said start signal) in Game triggered a process is made according to a given, and transparent to the participants Algorithm re-evaluates the weights associated with the subscriber, to determine the winner (if any, winners) and if necessary, the game ends. Method according to one of Claims 62 to 64, characterized that the Reference value REF one from the winner (or winners) awarded value corresponds. Method according to one of claims 1 to 65, characterized that for values (Data), which is distributed to the participants and by the process which participants should not be able to decipher, the participants only receive addresses or references of the data randomly chosen in the server (or an equivalent Station) stored data and that this Random assignment using a Method according to one of the claims 1 to 65, wherein in the server (or an equivalent station) to the Data stored there a the drawing result (in which the Random sequence of addresses, or references by the method was determined) corresponding reference table to the data created becomes. Method according to one of claims 1 to 66, or method according to the preamble of one of these claims or methods in own application - for generating a time randomly, - and / or for generating a random selection among several participants, - and / or for generating a Random sequence among several participants, - and / or for generating a random number (possibly also a number series, etc.) from a corresponding predetermined number set, - and / or for generating a random order from a corresponding predetermined number set. with the special features: a) that a device determines the order of arrival of action signals (identification signals) with respect to a random event (start signal), which several participants by sending these action signals (via their terminals) on a random basis Algorithm, which processes the action signals in the device and generates the random event, bring about the cumulative effect, or on the interaction of all sent by the participants to the device action signals (identification signals), b) that the generation of a random point by the under c) and / or that, in order to generate a random selection among several subscribers, the determination of the time sequence of the action signals (identification signals) or their associated data at the time (tref = ts) of the random event arriving under a) ( Starit signal) ode r is evaluated at a time (tref = ts - tmin) related to its temporal proximity to the random event (eg, evaluation by event measurement and / or via time measurement) at a time (ts), d) and / or for generation a random number (possibly also a number series), in the device of the participants entered action signals (identification signals) each have a digit or number or the immediate address (name) of the participants is assigned as data corresponding to the random number to be generated by the (or) the action signal (e) evaluated under c) the selection of the respectively assigned data or data is made as from the total amount of all available data, optionally with the further features: e) that the method for the Drawing of numbers is used: - the server assigns to the subscribers in each case numbers which are contained in the set of available numbers, and as data to those of the participants (resp. their terminals) emitted action signals (identification signals) in the ge called memory buffers of the server are (with) to be enrolled, the numbers associated with the action signals (identification signals) are counted as generated random numbers instead of the subscriber identification on arrival of the random event) to determine the randomly evaluated lottery numbers, with a preselection method, in the following Organization of participants is provided: A) the participants are grouped in two sets, a first set B and a second set J; B) wherein the group formation of the sets (B, J) can be made according to any categories, or even in the free choice of participants. For example, depending on the application, divided into a first set B of candidates, or applicants, from which a winner or a selected group of candidates is selected or nominated by delivery of the votes of all voting participants from the second set J; characterized by the following procedure (cf. 1 ): I) Each participant from the first set B, independently of all other participants of this set B, is assigned a specific minimum number of arbitrarily identifiable participants from the second set J, whereby an address relationship stored in this selection (eg a corresponding database, etc.) ) a) for each participant from the second set J from the data associated with it, those participants from the first set B to which the respective participant from the first set J has been assigned in each case can be taken; b) as well as for each participant from the first set B from the data associated with it, those participants can be taken from the second set J, which have been assigned to the respective participant from the first set B, wherein the addressing of a) after b), or vice versa from b) according to a), in addition to the direct storage of the reversibility can also be done by scanning or similar conventional database techniques; II) The participants from the second set J reduce by selection the number of participants from the first set B; III) The participants from the second set J play the game according to claims 1 to 66 to bring about interactive by dispensing corresponding action signals (Kennsignale) said random event (start signal), said random event by a randomly selected number or a character or drawing a number or string (each associated with the winner of the game from the set J) designating the one or more participants included in the first set B reduced in step II and each of the participants from the second set J, respectively be set; IV) Those participants from the second set J who have been assigned to the participant or those participants from the first set B, or who was drawn in the game of process step III (s), in step I repeatedly play the game accordingly of the claims 1 to 66 with the interactively delivered action signals (identification signals) bring about the said random event (start signal), said by this random event of the, or the associated delivered action signals (identification signals) corresponding participants from the set J (respectively) as a winner of the game is determined, wherein an assignment of the winner from the set B is made by the already made in step I assignment and, if several winners from the set B are assigned, if appropriate, the ranking of these winners (from the set B), as they is taken in step III, is taken into account. Process according to claim 67, characterized in that that the Ranking of a freely definable number of winners either the result of the first game accordingly (from process step III) or the result of the first game accordingly (from process step IV) is set accordingly, the assignment of the winner from the other amount of the taken in step IV Assignment corresponds.