WO2006036087A2

WO2006036087A2 - Television gaming method

Info

Publication number: WO2006036087A2
Application number: PCT/RU2005/000479
Authority: WO
Inventors: Valeriy Filippovich Ivanov
Original assignee: Ivanov Valeriy Fillipovich
Priority date: 2004-09-21
Filing date: 2005-09-21
Publication date: 2006-04-06
Also published as: WO2006036087A8; RU2268766C1

Abstract

The invention relates to games, in particular to television gaming methods and can be used for a television broadcasting system. The system for carrying out a novel gaming method comprises a control unit (23) which is disposed on the location (20) of players (21) and an operator (22) and is connected to computing means linked to televiewers (6, 13) by means of multi-access broadcast communications channels and additional multi-access broadcast communications channels. For communicating in-line with the operator (22), the players (21) are selected form the televiewers who interact with the computing means by means of at least one multi-access broadcast communications channel.

Description

METHOD OF TELEVISION GAME

Technical field

The invention relates to the field of games, in particular, to television games and may find application in a television broadcasting system. State of the art

There is a known method of conducting a television game, according to which, in an appropriate computing tool, a variant selected by the player of the television game from the current answers to the asked question, consisting of one true and at least two untrue answers, is compared, the result of this comparison with the true option is to give a decision on the correctness or incorrectness of the answer to the question (French application Ne 2651686, CL A 63 F 3/00, 1991). It can be noted that this method of conducting a television game is used in many television games similar to the game "Who wants to become a millionaire?" For the first time this game appeared on the air on the British channel ITV. According to the rules of its implementation, in order to win a million, you need to answer 15 questions, each time choosing one of the four proposed answer options.

The system in which this method is implemented includes a control panel located at the location of the players and the operator, connected to computing means connected to the viewers via broadcast communication channels with shared access (US patent N ° 5518253 A, class A 63 F

3/06, 1994).

The disadvantage of this, as well as other similar methods related to the choice of answers to the question posed, is their low entertainment due to the absence of any elements of competition in the game. In addition, a player’s simple choice of only one true option almost completely excludes a creative approach to the game. The disadvantages of the television system include the fact that its use excludes the participation of viewers directly in the game process. Disclosure of invention

The technical result, the solution of which the invention is directed, is an introduction to a television game related to the selection of the proposed answers to the question, elements of competition. In addition, the object of the invention is to provide such a system for conducting a television game ry in which viewers themselves can directly participate.

This task is achieved by the fact that in the method of conducting a television game, according to which the computing device compares the option selected by the television game player located in the television studio, for example, by interacting with the remote control connected to the computer, from the current answers to the question, consisting of from one true and at least two untrue answers, and the result of this comparison with the true option gives a decision on whether the answer is true or false but to the question posed. At the same time, in a computing tool, the player’s answer options are compared with the current answer options, and then they ask this question again, while the result of the comparison reduces the number of untrue answer options either by eliminating the player’s answer choices from them, or by using only those untrue ones options that are included in the above number of player-selected answer options. A system that implements this method comprises a control panel located at the location of the players and the operator connected to computing means connected to the viewers through broadcast channels of collective access, as well as a communication terminal and additional broadcast channels of collective access through which computing environments - The states are connected with the viewers, while the computing means and the communication terminal are interconnected by a specialized channel.

Brief Description of the Drawings

The invention is illustrated by the accompanying drawings, in which: FIG. 1 depicts a block diagram of a system for conducting a television game; figure 2 depicts a functional diagram of a system for conducting a television game in a television studio; Fig. 3 depicts a connection diagram of an individual storage device to a universal computer; figure 4 depicts a connection diagram to a data collection and processing center of an individual storage device; 5 depicts a first variant of a flow chart of a method for conducting a television game; 6 depicts a second variant of the algorithm diagram that implements the method conducting a television game; Fig.7 depicts a third variant of the algorithm diagram that implements the method of conducting a television game.

BEST MODES FOR CARRYING OUT THE INVENTION When describing the best embodiments of the present invention, for the convenience of reviewing the description, all abbreviations in parentheses after underlined words will refer to their initial letters.

Figure 1 presents a generalized structural diagram of a system for conducting a television game. The number 1 indicates the source of the television signal associated with the television game. The television signal source 1 includes a television center (TC) 2 and at least one television radio station 3, emitting generated television signals through a corresponding communication line 4, which the television viewer 6 senses through the television 5. The latter interacts with an individual memory device (IZU) 7 having a serial or identification number k. In addition to source 1, the system also contains other signal sources associated with a television game. The broadcasting signal source 8 includes a radio center 9 having a communication terminal (communications technology) 10, and at least one radio station 11 emitting generated signals through the corresponding communication lines 4, which are received by the radio receiver 12 while watching a television game viewer 13. The latter interacts with IZU 14, having a serial or identification number k. The computing means (support aids) of the bank 15, as well as those included in the data collection and processing center (DPC) 16 and at the subscriber station (AP) 17, the processing means 18 and the computer 19 are optional in some embodiments of the system, as will be shown below. Figure 2 presents a functional diagram of a system for playing a game in a television studio, which is included in the shopping center 2. The system contains a control panel 23 located at location 20 of the players 21 and operator 22, connected to a computing tool made in the form of a universal computer (hepegal- purrose) 24. In addition, the latter is connected to the scoreboard 25 of the operator, as well as to the receiving and transmitting terminals (sepd-receiver Тermiпl) 26, each of which has a scoreboard 27. In order to exclude promptings to players 21 from the side of the audience 28 between their places 29 location and location 20 of the players 21 is a translucent mirror 30. Moreover, the latter is set in such a way that the location 20 of the players 21 and the opera- torus 22 from the side of the audience 28 is visible, and the visibility of the location 29 of the location of the audience 28 from the players 21 is completely absent. As will be shown in the further description, in one embodiment of the system for conducting a television game, at least one viewer 28 may have an IZU 7 (14). Its detailed description is presented in Australian patent JN ° 757751, cl. A 63 F 03/06, 2003.

On fi.Z presents a functional diagram of connected to a universal computer 24 IZU 7 (14), which contains associated with the control unit 31 through the internal bus 32 memory 33, the counting unit 34, the device 35 input information, indicator 36 and device 37 output information which is part of the reverse data transmission channel from IZU 7 (14) to computer 24. If the built-in Bluetooth module is used as the information output device 37, then the same module should be included in the universal computer 24. Figure 4 shows a diagram of connections to the computing facilities of the DSOD 16, IZU 7 or 14 belonging to the viewer 6 or the radio listener 13. In this scheme, the method of unidirectional transmission of information can be used to transfer data from the IZU, while one of the information output devices is made in the form of an acoustic emitter 38, connected to the control unit 31 and matched in its characteristics with the telephone line 4. Thus, the structure of the return channel is formed by an acoustic emitter 38; a microphone 39 of the handset 40 connected to the telephone 41; one or several automatic telephone exchanges (ATS) 42, the last of which is connected via modems 43, 44 to the processing facility 18, which is included in the digital data center 16. This facility may include: uninterruptible power supply unit (UPS) 45, accurate time sensor 46, server 47 on the Intel STL-5000 platform, the Cisco 48 Eth-Router 2611 router, one or more workstations 49 made on the basis of the Intel Reptium - 4 processor. However, it should be noted that in the general case, the described system can include only some of the presented in figure 1 element comrade For example, if, under the terms of a television game, selection among radio listeners is not provided, then elements 8, 9, 10, 11, 12, 13, 14 should be excluded. In another example, when the universal computer 24 performs the functions of the processing means 18, elements 16 and 18 should be excluded.

In conclusion, a review of the elements of the television system, indicated in figures 1 to 4, we give the names of those communication channels that will be used in the further description. Moreover, any term “communication channel” or simply “channel” hereinafter means a combination of technical means (control panel 23; the receiver 12; TV 5; computing facilities - universal computer 24; modems 43, 44; IZU 7, 14; computer 19, etc.) and corresponding communication lines 4 for transmitting information (signals) from the sender to the recipient. So, in the system for conducting a television game, information is transmitted to viewers 6 about the operation of the control panel 23 by means of broadcast communication channels with collective access (multiassss broadstast сhappel), and about the operation of the communication terminal 10 through additional broadcast communication channels with collective access. The specialized channels may include computing tools 18, 19, 24 and the communication terminal 10, and the reverse channel, depending on the structure of the system, may include the following elements: information output device 37, the corresponding communication line 4, and one of the computing means 10 , 18, 19, 24. The operation of the system for conducting a television game is carried out in accordance with the algorithms shown in Figures 5 - 7. The practical implementation of these algorithms is carried out using special software, to It is stored in the memory of computing tools 7, 10, 14, 15, 18, 19, 24, as well as in the memory 33 of IZU 7, 14. In other embodiments, the implementation of each action in the presented algorithms can be carried out in the corresponding blocks created or using special programs , or through special electronic circuits. Figure 5 shows a diagram of an algorithm that reveals the main idea of the present invention. Its meaning lies in the fact that in the process of struggle between several players 21, for example, for a large cash prize, it is possible to choose from several proposed options not only the correct, but also obviously wrong answers. The beginning of a television game (action 50) is due to preliminary recording (action 51) to the corresponding computing means 10, 15, 18, 19, 24 of data in the form of questions with answer options. The latter are formed by the command of the operator 22, which through the control panel 23 calls them, for example, from the computer 19 on the scoreboard 25, and after the formation of the Z-th question (step 52), Q ^z + Q ^Z j is formed, where j = 1,2 , ... I, the current answers to it (step 53), one Q ^z of which is true, and Q ^z _{j are not} true, as well as an indication of the Z-th question and 1+ I of the current variants Q ^z , Q ^z _j responses to the scoreboard 25 (action 54). Moreover, each of the 1+ I current variants of Q ^z , Q ^z responses has a numerical or letter designation 3; , where i = 1, 2, ..., 1 + 1. After player 21 enters one true or J (J <I) untrue vari- answer responses (action 55) in universal computer 24 or in computer 19 connected to it through a specialized channel, they are compared (condition 56) with one true and I untrue variants. When a player enters (selects) a true answer (step 55), the corresponding computational tool, for example, universal computer 24, compares it (“1” in condition 56) with the true option and issues a decision about incorrectness (“No” in condition 57) or fidelity (“Yes” in condition 57) of the answer to the question posed, after which operator 22 asks a new Z + l question (action 58). If the true answer is incorrectly chosen (“No” in condition 57), it is excluded (action 59) from among the non-true variants, i.e. when asking the Z-th question again (action 52), the number of untrue answers is reduced by one: I = I - 1. When a player enters untrue answers (step 55) and after comparing them in a universal computer 24 with 1 + 1 current options of answers, the second question is asked again (step 52), but with a reduced number of 1 + 1 current options

15 tov at him. The decrease in the number of current options is based on the result of the above comparison, which can have two outcomes. The first outcome arises when the player J chooses the wrong answer options ("2" in condition 56). Obviously, in this case, a decrease in the number of 1 + 1 current answer options is due to the exclusion of J untrue options from them (step 61). The second outcome occurs when

20 incorrect selection by the player J of untrue answers ("3" in condition 56). Since with this outcome the true answer to the Zth question is among the J untrue variants, then the number of the latter should be one less if the Zth question is asked again, i.e. I = J - I (action 62). Thus, according to the comparison result in the universal computer 24 one or more selected

The 25 true choices of answers by the player reduce their number either by eliminating the choices of answers chosen by the player, or by using only those untrue options that are included in the above number of untrue answers of the player. Obviously, the process of re-asking the Z-th question occurs as long as at least one untrue version of the answer is saved (“No” in condition 62). Otherwise (“Yes” in condition 62), subject to the continuation of the television game (“Yes” in condition 63), a transition to a new Z + 1 question is made. Now consider the various options for players to receive points or money. The algorithm of one of these options is presented in Fig.6. In accordance with this algorithm, the beginning of the game (step 65) is associated with writing to the memory of a universal computer 24 of the total amount S ⁰ , for example, the monetary amount, which is distributed among all h (h = 1,2, ...) players by corresponding, according to predetermined calculation rules (action 66), the current amount S ° b and its transfer to the one generated in the universal computer 24 for each h player an individual score. Then, each of the players 21, before choosing the answer option, writes to his individual account through interaction with the receiving and transmitting terminal 26 the first (p = 1) current rate S _Ph = Sс ,, by the value of which, in turn, the current amount S ° _h decreases , while the current bets of all participants are summed up (action 67), i.e. S ^* = Su + S ₁₂ ⁺ ... + S ₁ A, where S ^* is the current fund; A is the number of players. Obviously, players have the right to make any bet within their current amount S ° _h or not to bet at all. After that, at the signal of the operator 22, the numbers 25 are displayed on the scoreboard corresponding to the value S _{1J1 of the} current bets made by each h by player 21, and the sequence of answers is determined (step 68) - the right to receive the first answer is given to player 21 whose current rate is higher. It should be noted that the sequence of answers in case of equality of current rates should be determined by the time t of their announcement by h players. Naturally, for t <tu _{+ \} h, the player has a time priority when choosing an answer over h + 1 player, and the time t _h is measured in the universal computer 24 between the time t _{z of the} appearance of the Zth question on the scoreboard, as well as (1 + 1) the current options for Q ^z , Q ^Z _j answers and time t _z ^h entering h by the player into the universal computer 24 of the current bet S _pl, i.e. th ⁼ t _z - tь. Further distribution of the current fund S depends on which option the player 21 announced after entering the answer option (condition 69). When applying for the “true answer” (“1” in condition 69), two outcomes are possible: by naming the really correct answer (“1” in condition 70) h player 21 receives (action 66) all that is left to this account individually the current fund S ^* , and in case of an incorrect answer ("2" in condition 70) h player 21 is not involved in further solving this question, i.e. loses the opportunity to win the current fund, and the right of answer passes (action 68) to the player 21 who made the next highest current rate on this question and who, in turn, can also choose one of the types of applications (condition 69), but, as already noted, from a reduced number of current answer options (action 71). Step 72 describes the calculation of the weight values Si of the untrue I answer options, which, as will be clear from the following description, are used to calculate the current sum S \. The value of Si in the general case is a function of F on the value S ^{* of the} current fund and on the number I of untrue variants from g vets, i.e. Si = F (S ^* , I). When applying for “untrue answer options” (“2” in condition 69), two outcomes are also possible: by naming J untrue answer options (“1” in condition 73), player 21 receives after performing actions 72, 66 to his individual account S ₁ x J points or monetary units, and the right to choose from (1 + 1 - J) the current answer options (act 74) passes (act 68) to the next player in turn. If h player 21 mistakenly chose the true option ("2" in condition 73), then the right to choose from J the current answer options (action 75) to the Zth question passes (action 68) to the player who made the next largest current bid. If, as a result of the game, none of the players 21 finds a true variant Q ^{z of an} answer to the Zth question, then the remaining part of the current fund may enter, for example, the current fund for Z +1 questions. Obviously, in all the cases under consideration, the right to choose options can go to the next player only if the number (1 + 1) of current answers is at least two (“No” in condition 76). Otherwise (“Yes” in condition 76), all the actions considered here are repeated for the Z + l question (action 77). After using all the questions (“No” in condition 78), the winner of the game is determined in the universal computer 24. The last is the h player who picks up (action 79) the maximum current amount S ° _h in his individual account. One of the ideas of this invention is to provide any of the viewers with the opportunity to participate in a television game, even if it is pre-recorded in the shopping center 2. A general algorithm for the participation of viewers in a television game is presented in Fig.7. The basis of his work is action 82, which describes reading through a specialized channel from a database stored in one of the computing tools of the 18th, 19th, 24th, Zth question and (1 + 1) current answers, as well as actions 84, 85, respectively describing their transmission to viewers 6 through a broadcast communication channel with collective access, and viewers 13 through an additional broadcast communication channel with collective access. The last action provides the opportunity for those viewers who watch it in the recording to participate in the television game. Further actions are related to writing in memory 33 of IZU 7, 14 the number j of the answer option to the Zth question (act 86), and in their absence (“No” in condition 87) - with the transfer (act 89) of data from the IZU through the return channel to one of the computing tools 18, 19, 24 and calculating (step 90) the times T (Зi, k ^* ), T (3;, k) of the record in IZU number Зi of the answer to the Zth question. These actions are described in detail in Australian patent JV ° 757751. We only note that the calculation, for example time T (3,, k ^* ) in the processing means 18, is reduced to computing in the workstation 49 according to one of the following formulas: T (S ₁ , k) = T _t - Pk * (N _t - N ₁ ) + Y ( for N _t > N ₁ ), T (i, k ^* ) = T _t + P _{k *} (N ₁ - N _t ) + Y (for N _t <N ₁ ), where T ₁ is the current time of the exact time sensor 46 recorded in workstation 49 at the time of reading data from memory 33 of IZU 7.14, P _{k *} is the time parameter of the time reference node, N ₁ is the temporary data stored in the memory 33, N _t is the current time data issued by the time reference node 34 at the time of their reading, Y is the calculation error T (3,, k), which in the general case depends on the value the time interval between writing the number 3 _{t of} the answer option to the ICU and reading it. The time parameter P _{k *} can be represented in the form 1 / f _k ”, where fk _* is the frequency of the temporal data N of the time reference node 34 or in the form of the period T _{k *} of the temporal data. The frequency and period, in turn, can be calculated using the formulas fк _* = (N _tl - Nt ₂ ) / (T _tl - Tt ₂ ), 1 / fк _* , where N _tl , Nt ₂ are the current data issued by the reference node time 34 at the moments of the corresponding current times T _tl , T _t2 read these data. Further processing of the above data (act 91) and posting of the results of this processing (act 92) is also carried out in one of the aforementioned 18, 19, 24 computing facilities of the television system. In conclusion, we present several specific examples illustrating the operation of the described system, a variant of the structural diagram of which is shown in Fig. 4. Example 1. This example describes the full cycle of a television game consisting of three questions (Z = 1, 2, 3), the beginning of which is due to the transmission of the first question via an additional broadcast communication channel with shared access during the current television game (Z = 1 ) and five variants Q \, θL, RL, Q ^1, Q \ responses to it, with the numerical designation 3, the true embodiment Q ¹ is equal to four (Sr = 4). All questions and answer options for a television game are stored in the computer 19, and the above transmission was carried out by means of a radio 12 after exposure to the communication terminal 10 and reading through the specialized channel of the first question and five answer options. After the viewer 13 recorded in IZU 14 with the number k ^* = 34588 the digit “4” (that is, records in the IZU the true answer), the data associated with this record was transferred to the DSC 16. The time T (3,, k ^* ) = T (2, 34588) calculated at TsODS 16 = 17 hours 15 minutes 7.1 seconds of recording the true answer was transmitted via communication line 4 to computer 19, in which it was determined that it is the smallest of all times calculated from the data received from the IZU. Since the condition for the viewer 13 to participate in the television game as the viewer 28 was guessing the true answer with the least time spent thinking about it, the number k = 34588 was displayed on the screens of TVs 5 during the current television game as an invitation to that viewer 13 who owns the IZU with this number. Before the beginning of the described television game in a universal computer 24, two questions (Z = 2,3) and 10 answers were read from computer 19, and the total amount S ⁰ = 24,000 rubles was entered into the memory of universal computer 24. The latter was distributed among 3 (h = 3) players evenly, i.e. 8000 rubles were transferred to each player’s individual account (S ⁰ _! = S ° ₂ = S ° ₃ = 8000 rubles). In addition, the mathematical expression Si = F (S ^* , I) = S ^* / (1 + I) was entered into the memory of universal computer 24, which made it possible to calculate the weight values of Si of untrue I answer options. After calling from the universal computer 19 on the scoreboard 25 the second question (Z = 2) and 5 answer options Q ² _! , Q ² , Q ² ₂ , Q ² s, Q ² _{4 the} first (h = 1), second (h = 2) and third players (h = 3) wrote down their individual accounts by interacting with the receiving and transmitting terminal 26 first (p = 1) current bets: S ₁₁ = 5600 rubles, S ₁₂ = 7000 rubles, S ₁₃ = 5200 rubles. Thus, the values of the current fund and the corresponding current amounts will be as follows: S ^* = 17800, S ° i = 2400 rubles, S ° ₂ = 1000 rubles, S ° s = 2800 rubles. So, after obtaining the right of the first answer, the second player entered the true version of the answer by typing on the keyboard of the transceiver terminal 26 the number 1, which means entering the true version of Q ² and the number 2, which means its serial number. Since the choice of the second player turned out to be right, on the individual accounts of the first, second and third players, respectively, became S ⁰ ! = 2400 rubles, S ° ₂ = 18800 rubles, S ° ₃ = 2800 rubles. Similarly, after calling from the universal computer 19 on the scoreboard 25 the third question (Z = 3) and 5 answer choices CD, Q ³ ₂ , θД, СД, Q ^{3, the} first, second and third players recorded their second accounts on their individual accounts (p = 2 ) current rates: S ₂ i = 2400 rubles, S ₂₂ = 2850 rubles, S ₂₃ = 2800 rubles, i.e. the weight values of Si, as well as the values of the current fund and the corresponding current amounts, were as follows: Si = 1610 rubles, S ^* = 8050 rubles, S ° i = 0 rubles, S ° ₂ = 15950 rubles, S ° ₃ = 0 rubles. After receiving the right of the first answer again, the second player, not knowing the true variant of the CD, entered two untrue answers of answers Q ³ ₂ , CD by typing in the keyboard of the transceiver terminal 26 the number 0, which means entering the untruthful options and digits 2, 4, which means their serial number. Since this choice turned out to be correct, on the individual accounts of the first, second and third players, the values of the current amounts became respectively the following: S ° i = 0 rubles, S ° ₂ = 19,170 rubles, S ° s = 0 rubles. At the same time, the value S ^{* of the} current fund, after recounting in a universal computer 24, began to equal 4830 rubles. Since the second largest current bet belongs to the third player, he received the right to choose the answer to the third question, but from three answer options: Q ³ _J , Q ³ ₃ , Q ³ . However, choosing the CD option as true, the third player did not receive any amount of money in his individual account, and the right to choose from two options Q ³ _ls Q ³ passed to the first player. The latter guessed the true version of Q ³ declared by him, having typed the number “1” and the number “5” on the keyboard of the transceiver terminal 26. Thus, the first player finished the game by writing 4830 rubles to his individual account. Immediately after the end of the game in Shopping Center 2, the selection was made for the next television game of players 21 from the audience of 28 having PSU 7. The selection process consisted of connecting PSU 7 to computer 24, as well as reading data into it and processing them. The latter was reduced, firstly, to the calculation in a universal computer of 24 the sum of S (k) points produced by the formula S (k) = 100 X (T ₁ -T ₁ ^* ) + 200 x (T ₂ - T ₂ ^* ) + 400 x (T ₃ - T ₃ ^* ), where T ₁ , T ₂ , T ₃ - time moments of asking the first (Z = I), second (Z = 2) and third (Z = 3) questions; T ₁ ^* , T ₂ ^* , T ₃ ^* - the moments of time of writing in memory 33 true variants of answers Q ¹ , Q ² , Q ³ . And, secondly, to the choice of IZU 7 with such k, according to which the largest sum S (k) was calculated. In conclusion, it can be noted that the selection of viewers 28 among viewers 6 or 13 may occur during the showing of a pre-recorded television game. In this case, the formation of questions and answers to them on TV screens can be carried out in one of the following ways: in the form of generated information (for example, in the form of text information with soundtrack) before the broadcast of the television game; in the form of information generated during the broadcast of a television game; in the form of formed answer options before the start of the television broadcast, and the question itself during or after the broadcast, etc. In addition, viewers 6, 13 can record untrue answer options in their research institutes (declaring them, of course, as untrue) , gaining in this case fewer points.

Example 2. This version of the game can be conducted according to the following rules: in the final, four players 21 compete, selected in the previous game from the players 28 in the television studio; each time the leader 22 sets (action 52) Z - the second question with an initial cost of 4,000 rubles and 4 possible answers (1 + 1 = 4); the player with the largest amount has the right to choose the answer to the question; the remaining order of choice is chosen by the players in accordance with the accumulated amounts; while reducing the number of options (I + 1) the answer, the cost of the question is reduced by half; player 21, who called the correct answer untrue, is eliminated from further struggle, and the leader asks the next question to three players; with each transfer of the right to answer the question its cost is reduced by 2 times. Let the host ask the first question (Z = I) worth 8,000 rubles "What is the area of the Vatican City?" and 4 possible answers: 1. 148 hectares; 2. 44 hectares; 3. 55 hectares; 4. 48 hectares. Let 4 players 21 compete in the finals (in parentheses are the amounts accumulated by the players in the previous game) - A (150), B (200), B (160), G (170). Let player B, having the largest amount S = 200, choose the right of the first answer and, not knowing the correct option, choose the untrue 1st option ("2" in condition 56), transferring the right of answer to this question to player D, but from 3 answer options (1 + 1 = 3): 2. 44 hectares; 3. 55 hectares; 4. 48 hectares. Moreover, the cost of the question was reduced to 4,000 rubles (72), which was received by player G by choosing ("1" in condition 56, "Yes" in condition 57) the correct 2nd option for answering the re-asked first question Z = I (" No "in condition 62). Example 3. This version of the game can be conducted according to the following rules: in the final, four players 21 also compete, selected in the previous game from the players 28 located in the television studio; each time the presenter 22 asks a question with an initial cost of 8,000 rubles and 4 possible answers; the player with the largest amount in his individual account has the right to choose the procedure for answering the question (action 68); the remaining order of choice is chosen by the players in accordance with the accumulated amounts; if you do not know the correct answer option, the right to choose the option is transferred to the next player; if none of the players knows the correct answer, the first player in the amount collected gains the right to choose a false answer; with each transfer of the right to answer the question its cost is reduced by 2 times. Let the host 22 ask a question worth 8,000 rubles "What is the area of the Vatican City?" and 4 possible answers: 1. 148 hectares; 2. 44 hectares; 3. 55 hectares; 4. 48 hectares. Let 4 players compete in the final (in parentheses are the amounts collected by the players in the previous game) - A (150), B (200), B (160), G (l 70). Let player B, having the largest amount S = 200, choose the right of the first answer and, not knowing the correct option, transfer the right of choice to player G. The last, not knowing the correct option, transfer the right of choice to player B, who transferred the right to answer to player A. The latter transferred the right to answer to player B, since he also could not choose the correct answer. After that, player B stated that the first option was incorrect and transferred to player D the right to answer this question, but with a reduced number of answer options. The cost of the issue at the same time became equal to 8000/2 x 2 ^χ 2><2 ^χ 2 = 250 rubles. Example 4. This version of the game can be carried out according to the following rules: 2 - 4 players 21 also compete in the final; each time the facilitator asks a question with an initial cost of 8,000 rubles and 4-6 answers; the sequence of answers is formed after asking a question by pressing the button on the corresponding remote control, moreover, pressing the green button indicates the willingness of player 21 to choose the correct answer, and pressing the red button means the willingness of player 21 to choose the wrong answer; priority in answers is given to those players who pressed the green buttons; with each transfer of the right to answer the question its cost is reduced by 2 times. Let the host 22 ask a question worth 8,000 rubles "What is the area of the Vatican City?" and 5 answer options (1 + 1 = 5): 1. 148 hectares; 2. 44 hectares; 3. 55 hectares; 4.256 hectares; 5. 48 hectares. Immediately after asking a question, each of the players 21 pressed a red or green button on their remote control, as a result of which the following order of answering this question was displayed on the monitor screen of the universal computer 24: B, B, A, G. At the same time, B and B were highlighted green, which means the willingness to choose the correct answer, and A and D were highlighted in red, which means the willingness to choose the wrong answer. Let player B, who has the right to choose the right option for the first answer, choose option 3. 55 hectares. Since this option is incorrect, player B is excluded from further play. Then the presenter asks the second question (Z = 2) worth 8,000 rubles: "In what year was the city of Moscow founded?" and 5 possible answers: 1. 1148; 2.147; 3.1167; 4. 1247; 5. 1347. Immediately after asking a question, each of the players B, A, G pressed a red or green button on their remote control, as a result of which the following order of answering this question was displayed on the monitor screen: A, G, B. Moreover, A and D were highlighted in green, which means that they were ready to select the correct answer, and B was highlighted in red, which means that player B was ready to select the wrong answer. Let player A, who has the right to choose the correct variant of the first answer, choose option 1. 1148. Since this option is incorrect, player A is also excluded from the further game. Next, the presenter 22 asks a question worth 8,000 (or more, as an option) rubles and 5 answers: "In what year was the city of Petersburg founded?" and 5 possible answers: 1. 1701; 2.1703; 3.1707; 4.1711; 5. 1713. Immediately after asking a question, each of the players B, D pressed the red or green button on their remote control, as a result of which the following order of answers to this question was displayed on the monitor screen: G, B. At the same time, G and B were highlighted in red color, which means the readiness of the player G and B to choose the wrong answer. After that, player G stated that option 1 and 5 were incorrect and transferred to player B the right to answer this question, but with a reduced number of answer options: 2. 1703; 3.1707; 4. 1711. The cost of the issue at the same time became equal to 8000/2 = 4000 rubles. Further, the struggle for the correct answer to the second question was completed after player B chose the correct answer 2. 1703. The structure of a television game can also take various forms. For example, if the game is sporting in nature, then the Z question may mean some kind of sporting action (the video information of a famous football match related to a free kick shown on the scoreboard 25; a blow in the conditions of shopping center 2 to a small football goal of the player himself, etc. ), and under Q ^z + Q ^Z _{j the} current options are the outcomes (hitting the ball into the goal, hitting the ball into the goal post, hitting the ball in the crossbar, etc.). In order to attract the maximum number of people, the game may include two preliminary rounds and a final. In the first round, pre-selected players 21 (3-4 people) take part, and in the second round, player 21, who showed the worst result in the first round, is occupied by viewer 28, who showed the best result in the first round. In the final, two players who showed the worst result in the second round are occupied by another spectator who showed the best result in the total results of the first and second rounds, and an honorary guest of the program or one of the winners of previous games.

Industrial applicability The invention can be used to organize games both on television channels and in other systems for transmitting information to game participants, for example, on the global Internet. The advantage of this invention is that players are required not so much to know the correct answer as to be able to calculate a deliberately incorrect answer, not so much a risk as strategic and tactical thinking. The latter may consist, for example, in the development of such a game strategy that takes into account a number of factors (player strength, number of players, complexity of questions, number of answer options, order of answers, etc.), in which the initially asked question with a minimum number of "returns" to the player answer options for it.

Claims

CLAIM

1. A method of conducting a television game, according to which, in the comparison unit of the computing means (24), the option selected by the player (21) is compared (56), for example, by interacting with the remote control connected to the computing means (24) from the current answers to the given question (52), consisting of one true and at least two untrue answers, and according to the result of this comparison (“1” in condition 56) with the true option they give (57) a decision on fidelity (“Yes” in condition 57 ) or infidelity (“No” in condition 57) of the response to delivery a different question, characterized in that (56) in the comparison unit of the computing means (24) are compared with the player’s answer options with the current answer options, then they are asked again (52) this question, while the result of the comparison is reduced in the corresponding block of the computing tool ( 24) the number of untrue answer options either by eliminating (61) from them the choices of answers chosen by the player, or by using (60) only those untrue options that are included in the above number of choices of answers by the player.

2. The method according to claim 2, characterized in that for each player (21) of the television game, an individual account is generated (65, 66) in the appropriate computing tool, onto which the initial amount, for example, the money, is recorded.

3. The method according to p. 2, characterized in that each of the players (21) of the television game before writing the answer option writes (67) to his individual account through interaction with the receiving and transmitting terminal the current rate, the value of which, in turn, reduce the initial amount, while the current rates of all participants summarize.

4. The method according to claim 2, characterized in that in the unit for comparing the computing means, the current rates are compared and the result of this comparison determines (68) the sequence of the response of each player (21) of the television game to the question.

5. The method according to claim 2, characterized in that the sum of the current bets is transferred to the individual account of the player (21) if he chooses the correct option.

6. The method according to claim 2, characterized in that they transfer a predetermined portion of the amount of current bets to the individual account of the player (21) if he correctly selects one or more untrue answer options.