US2008242419A1PendingUtilityA1

Server method for supporting a game

50
Assignee: NOKIA CORPPriority: Mar 29, 2007Filed: Mar 29, 2007Published: Oct 2, 2008
Est. expiryMar 29, 2027(~0.7 yrs left)· nominal 20-yr term from priority
A63F 13/12A63F 2300/8064A63F 13/5375A63F 13/80A63F 2300/558A63F 13/847A63F 13/798A63F 13/30
50
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A computer server method for supporting a word game, in which proposed words are received from participants; target data is determined; and for each proposed word: result data related to a semantic distance between the proposed word and the target data is determined; the result data is sent to the participant from whom the proposed word was received; and the result data is compared with a goal criterion. These operations are repeated until at least one result data fulfils the goal criterion, and then: a winner is determined; and a winner announcement is sent to all participants.

Claims

exact text as granted — not AI-modified
1 . A computer server method for supporting a word game, comprising: repeating:
 receiving proposed words from participants;   determining target data; and   for each proposed word:
 determining result data related to a semantic distance between the proposed word and said target data; 
 sending said result data to the participant from whom the proposed word was received; and 
 comparing said result data with a goal criterion; 
   
     until at least one result data fulfils the goal criterion, and then:
 determining a winner; and 
 sending a winner announcement to all participants. 
 
   
   
       2 . A computer server method according to  claim 1 , wherein said determining target data comprises determining a common semantic center of all proposed words. 
   
   
       3 . A computer server method according to  claim 1 , wherein said determining target data comprises determining a common semantic center of all presently and previously proposed words. 
   
   
       4 . A computer server method according to  claim 1 , wherein said participants are members of at least two teams. 
   
   
       5 . A computer server method according to  claim 4 , wherein said target data is individual to each team. 
   
   
       6 . A computer server method according to  claim 4 , wherein said step of determining a winner comprises one of a group of alternatives comprising:
 determining which member is fastest to fulfil the goal criterion, and declaring the corresponding team as winner;   determining which members of the same team all fulfil the goal criterion first, and declaring the corresponding team as winner; and   incrementing a count for each member at each sending, determining a total count for each team, and declaring as a winner the team having the lowest total count.   
   
   
       7 . A computer server method according to  claim 1 , wherein said determining target data comprises determining a target word by means of a determination algorithm. 
   
   
       8 . A computer server method according to  claim 7 , wherein said determination algorithm is a randomizing algorithm. 
   
   
       9 . A computer server method according to  claim 1 , wherein said goal criterion is a predetermined range of result data. 
   
   
       10 . A computer server method according to  claim 1 , wherein said goal criterion is a predetermined range of semantic distance from the target data. 
   
   
       11 . A computer server method according to  claim 1 , wherein said participants comprise at least one team having at least two team members, wherein, for each team, said target data constitutes the proposed word from a first participant of the team. 
   
   
       12 . A computer server method according to  claim 11 , further comprising incrementing a count for each further participant of said team, at each said sending. 
   
   
       13 . A computer server method according to  claim 12 , wherein said participants comprise at least two teams, wherein said determining a winner comprises comparing total counts of the teams and declaring the team having the lowest total count as winner. 
   
   
       14 . A computer server method according to  claim 1 , further comprising, before said repeating, selecting a target picture from a picture database, wherein said participants comprise teams, where each team has two participants, wherein said determining target data comprises, for each team:
 presenting the picture to the participants, receiving a target word associated with said picture from each participant, and employing as target data for each respective participant the target word received from the other participant.   
   
   
       15 . A computer server method according to  claim 14 , further comprising incrementing a count for each participant of said team, at each said sending, wherein said determining a winner comprises determining the total count for each team and declaring as winner the team having the lowest total count. 
   
   
       16 . A computer server method according to  claim 14 , further comprising performing said repeating a maximum number of times, and if no result data has fulfilled the goal criterion when said maximum number of times has been reached, then said determining a winner comprises comparing the final semantic distances of the teams and declaring the team having the shortest semantic distance as winner. 
   
   
       17 . A computer program product, directly loadable into the internal memory of a digital computer, comprising software code portions for performing the computer server method according to  claim 1 .

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.