GB2054390A

GB2054390A - Lottery Ticket

Info

Publication number: GB2054390A
Application number: GB7926560A
Authority: GB
Original assignee: Don Marketing Management Ltd
Current assignee: Don Marketing Management Ltd
Priority date: 1979-07-31
Filing date: 1979-07-31
Publication date: 1981-02-18

Abstract

Participants each have a ticket (1) bearing a list of n names (2) chosen from the names of N characters performing in a play. Each participant notes the order in which the characters speak in the play and compares this with the order in which characters' names are listed on each of their tickets. <IMAGE>

Description

SPECIFICATION Apparatus for playing game The invention relates to a game to be played by two or more people and, in particular, by large numbers of people.

In a system in which there are a plurality of different indentities and these identities can occur in different, random order, there is an infinite variety in the order in which these identities can be presented or arranged. Moreover, by means of electronic computers, it is possible to prepare a plurality of unique lists of at least some of the different identities.

It is the objective of the invention to utilize the hereinbefore described facility of computer technology to prepare a plurality of unique lists of identities which can be used to play a game.

According to the invention, apparatus for playing a game comprises a first plurality of tickets each listing at least some of a second plurality of names of different characters in a play, in different order.

To play the game, participants are each given at least one ticket and then must note the order in which the characters appear, speak or perform some other easily identifiable action. The participants then compare the order in which these occurrences take place with the lists set out on their tickets and the winner is the participant whose list comforms more closely with the actual order of occurrences than the lists given to other participants. For example, the winner may be the participant who is given a list containing the longest unbroken sequence of characters corresponding to the sequence derived from the play.

To provide a finite first plurality of sequences involving a second plurality of "N" characters, it is possible to disregard second and subsequent occasions on which each different character should be listed so that each character is listed only once and each ticket has a third plurality of "n" names listed.

In this event, it is possible to limitthe number of tickets to a first plurality equal to N!/(N-n)! Thus, if there are twenty-six characters in the play and each list contains four names, the number of tickets equals factorial 26 divided by factorial 22 (i.e. 264), or 26x25x24x23 = 358800. Of cou rse, fo r con- venience, each list can be marked with the name of the play and the part of the play to which the lists of names relate.

Although it is not absolutely necessary, the lists preferably relate to occurences in unpublished plays such as plays which are broadcast by television and radio. Conveniently, the lists apply to specific episodes or parts of episodes of serialised television and radio plays.

In orderto disclose the invention in a manner which is clear enough and complete enough for the invention to be performed by a person skilled in the art, an embodiment of the invention is hereinafter described by way of example, with reference to the accompanying drawings.

Figure 1 shows apparatus, according to the invention, for playing a game, based on a television programme, between two participants; and Figure 2 is a view of a ticket for use in a game such as that described with reference to Figure 1.

Four tickets 1, each bearing four character designations 2 of a play broadcast on a television set 3 are provided in two sets 4 and 5 respectively provided fortwo participants. In the particular programme to which the lists of designations 2 relate, there are twenty-six characters whose names, for convenience, have been shown as letters ofthe alphabet.

Each ticket 1 contains four different designations and so only the first occasion on which each character speaks, during the television programme, is to be noted.

As there are twenty-six names divided into lists of four names, there is a total of 26!1(264)! = 26 !l22 ! = 26 x 25 x 24 x 23 = 358 800 different lists possible.

Clearly, if one of the tickets 1 in the sets 4 and 5 lists four names in the precise order in which the players of the television programme speak, then the participant with that ticket wins. However, where the full complement of 358800 tickets are not used, the winning participant is the participant who holds a list 1 in which the designations 2 conform most closely with the order i which the different characters speak during the programme.

As shown in Figure 2, a ticket 1 suitable for use in playing the game described with reference to Figure 1 is marked with the name "Crossroads" to indicate the name of the television play to which it relates. As also shown, the date of the programme is indicated as 12th April 1980. The names 2 are provided in two lists respectively for Parts One and Two of the programme. As also indicated, if the players speak in the order indicated on the ticket 1, for the two parts, the participant holding the ticket 1 wins five points in each case, but if the players in both parts speak in the listed order, the participant wins a jackpot prize of twenty points. Clearly, where very large numbers of participants are available, the game may be played in the form of a lottery. In this case, the winner may be awarded a prize rather than scoring points.

1. Apparatus, for playing a game, comprising a first plurality of tickets (1) each listing at least some of a second plurality of names (2) of different characters in a play, in different order.

2. Apparatus, according to Claim 1, in which each ticket (1) lists a third plurality of different names (2) and the first plurality equals N !/(N-n)! where "N" equals the second plurality and "n" equals the third plurality.

3. Apparatus, for playing a game, substantially as hereinbefore described with reference to and as illustrated in Figures 1 and 2 of the accompanying drawings.

**WARNING** end of DESC field may overlap start of CLMS **.

Claims

**WARNING** start of CLMS field may overlap end of DESC **. SPECIFICATION Apparatus for playing game The invention relates to a game to be played by two or more people and, in particular, by large numbers of people. In a system in which there are a plurality of different indentities and these identities can occur in different, random order, there is an infinite variety in the order in which these identities can be presented or arranged. Moreover, by means of electronic computers, it is possible to prepare a plurality of unique lists of at least some of the different identities. It is the objective of the invention to utilize the hereinbefore described facility of computer technology to prepare a plurality of unique lists of identities which can be used to play a game. According to the invention, apparatus for playing a game comprises a first plurality of tickets each listing at least some of a second plurality of names of different characters in a play, in different order. To play the game, participants are each given at least one ticket and then must note the order in which the characters appear, speak or perform some other easily identifiable action. The participants then compare the order in which these occurrences take place with the lists set out on their tickets and the winner is the participant whose list comforms more closely with the actual order of occurrences than the lists given to other participants. For example, the winner may be the participant who is given a list containing the longest unbroken sequence of characters corresponding to the sequence derived from the play. To provide a finite first plurality of sequences involving a second plurality of "N" characters, it is possible to disregard second and subsequent occasions on which each different character should be listed so that each character is listed only once and each ticket has a third plurality of "n" names listed. In this event, it is possible to limitthe number of tickets to a first plurality equal to N!/(N-n)! Thus, if there are twenty-six characters in the play and each list contains four names, the number of tickets equals factorial 26 divided by factorial 22 (i.e. 264), or 26x25x24x23 = 358800. Of cou rse, fo r con- venience, each list can be marked with the name of the play and the part of the play to which the lists of names relate. Although it is not absolutely necessary, the lists preferably relate to occurences in unpublished plays such as plays which are broadcast by television and radio. Conveniently, the lists apply to specific episodes or parts of episodes of serialised television and radio plays. In orderto disclose the invention in a manner which is clear enough and complete enough for the invention to be performed by a person skilled in the art, an embodiment of the invention is hereinafter described by way of example, with reference to the accompanying drawings. Figure 1 shows apparatus, according to the invention, for playing a game, based on a television programme, between two participants; and Figure 2 is a view of a ticket for use in a game such as that described with reference to Figure 1. Four tickets 1, each bearing four character designations 2 of a play broadcast on a television set 3 are provided in two sets 4 and 5 respectively provided fortwo participants. In the particular programme to which the lists of designations 2 relate, there are twenty-six characters whose names, for convenience, have been shown as letters ofthe alphabet. Each ticket 1 contains four different designations and so only the first occasion on which each character speaks, during the television programme, is to be noted. As there are twenty-six names divided into lists of four names, there is a total of 26!1(264)! = 26 !l22 ! = 26 x 25 x 24 x 23 = 358 800 different lists possible. Clearly, if one of the tickets 1 in the sets 4 and 5 lists four names in the precise order in which the players of the television programme speak, then the participant with that ticket wins. However, where the full complement of 358800 tickets are not used, the winning participant is the participant who holds a list 1 in which the designations 2 conform most closely with the order i which the different characters speak during the programme. As shown in Figure 2, a ticket 1 suitable for use in playing the game described with reference to Figure 1 is marked with the name "Crossroads" to indicate the name of the television play to which it relates. As also shown, the date of the programme is indicated as 12th April 1980. The names 2 are provided in two lists respectively for Parts One and Two of the programme. As also indicated, if the players speak in the order indicated on the ticket 1, for the two parts, the participant holding the ticket 1 wins five points in each case, but if the players in both parts speak in the listed order, the participant wins a jackpot prize of twenty points. Clearly, where very large numbers of participants are available, the game may be played in the form of a lottery. In this case, the winner may be awarded a prize rather than scoring points. CLAIMS

3. Apparatus, for playing a game, substantially as hereinbefore described with reference to and as illustrated in the accompanying drawing.

New claims or amendments to claims filed on 4/8/80.

Superseded claims 1 and 3.

New or amended claims:

1. Apparatus, for playing a game, comprising a script of a play, means (3) for broadcasting the text of the script (S) of the play, and a first plurality of tickets (1) each listing at least some of a second plurality of means (2) of different characters in a play, in different order.