Patent Grant
8814670
This application relates to systems and methods for playing a multiplayer game, and in particular, to providing a queuing game to a user waiting to join a multiplayer game.
The systems and methods of the development each have several aspects, no single one of which is solely responsible for its desirable attributes. Without limiting the scope of this disclosure as expressed by presented claims, its more prominent features will now be discussed briefly. After considering this discussion, and particularly after reading the section entitled “Detailed Description” one will understand how the sample features of this development provide advantages that including providing a queuing game to user waiting to join a multiplayer game.
One aspect is a method for providing a queuing game, the method comprising queuing a player for a multiplayer game, determining that at least one criterion for beginning the multiplayer game has not been met, beginning a queuing game for the queued player, determining that the criterion has been met, and, in response to determining that the criterion has been met, ending the queuing game for the player, determining a queuing game outcome for the player, and beginning the multiplayer game, wherein the multiplayer game is based, at least in part, on the queuing game outcome.
Another aspect is a system for providing a queuing game, the system comprising a processor configured to queue a player for a multiplayer game, determine that at least one criterion for beginning the multiplayer game has not been met, begin a queuing game for the queued player, determine that the criterion has been met, and, in response to determining that the criterion has been met, end the queuing game for the player, determine a queuing game outcome for the player, and begin the multiplayer game, wherein the multiplayer game is based, at least in part, on the queuing game outcome. The system also comprises an interface configured to receive user input and output results based on the user input.
Another aspect is a system for providing a queuing game, the method comprising means for queuing a player for a multiplayer game, means for determining that at least one criterion for beginning the multiplayer game has not been met, means for beginning a queuing game for the queued player, means for determining that the criterion has been met, means for, in response to the determination that the criterion has been met, ending the queuing game for the player, means for, in response to the determination that the criterion has been met, determining a queuing game outcome for the player, and means for, in response to the determination that the criterion has been met, beginning the multiplayer game, wherein the multiplayer game is based, at least in part, on the queuing game outcome.
Another aspect is a computer-readable medium having instructions encoded thereon which, when executed by a computer, cause the computer to perform a method of providing a queuing game, the method comprising queuing a player for a multiplayer game, determining that at least one criterion for beginning the multiplayer game has not been met, beginning a queuing game for the queued player, determining that the criterion has been met, and, in response to determining that the criterion has been met, ending the queuing game for the player, determining a queuing game outcome for the player, and beginning the multiplayer game, wherein the multiplayer game is based, at least in part, on the queuing game outcome.
The following detailed description is directed to certain specific aspects of the development. However, the development can be embodied in a multitude of different ways, for example, as defined and covered by any presented claims. It should be apparent that the aspects herein may be embodied in a wide variety of forms and that any specific structure, function, or both being disclosed herein is merely representative. Based on the teachings herein one skilled in the art should appreciate that an aspect disclosed herein may be implemented independently of any other aspects and that two or more of these aspects may be combined in various ways. For example, an apparatus may be implemented or a method may be practiced using any number of the aspects set forth herein. In addition, such an apparatus may be implemented or such a method may be practiced using other structure, functionality, or structure and functionality in addition to or other than one or more of the aspects set forth herein. Similarly, methods disclosed herein may performed by one or more computer processors configured to execute instructions retrieved from a computer-readable storage medium. A computer-readable storage medium stores information, such as data or instructions, for some interval of time, such that the information can be read by a computer during that interval of time. Examples of computer-readable storage media are memory, such as random access memory (RAM), and storage, such as hard drives, optical discs, flash memory, floppy disks, magnetic tape, paper tape, punch cards, and Zip drives.
In one embodiment, the host device 110 is a game server that receives requests to join a multiplayer game from the client device 120a, 120b, 120c, which are, for example, personal computers or gaming consoles. During play of the multiplayer game, the host device 110 receives gaming commands from the client devices 120a, 120b, 120c, processes the information based on gaming software stored at the host device 110, and transmits gaming results to the client devices 120a, 120b, 120c. In another embodiment, a multiplayer game is played by users of the gaming devices 120a, 120b, 120c without the need for a dedicated game server or host device 110.
The processor 210 can be a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any suitable combination thereof designed to perform the functions described herein. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
The processor 210 can be coupled, via one or more buses, to read information from or write information to memory 220. The processor may additionally, or in the alternative, contain memory, such as processor registers. The memory 220 can include processor cache, including a multi-level hierarchical cache in which different levels have different capacities and access speeds. The memory 220 can also include random access memory (RAM), other volatile storage devices, or non-volatile storage devices. The storage can include hard drives, optical discs, such as compact discs (CDs) or digital video discs (DVDs), flash memory, floppy discs, magnetic tape, and Zip drives.
The processor 210 is also coupled to an input device 230 and an output device 240 for, respectively, receiving input from and providing output to, a user of the user device 200. Suitable input devices include, but are not limited to, a keyboard, buttons, keys, switches, a pointing device, a mouse, a joystick, a remote control, an infrared detector, a video camera (possibly coupled with video processing software to, e.g., detect hand gestures or facial gestures), a motion detector, a microphone (possibly coupled to audio processing software to, e.g., detect voice commands), or an accelerometer. Suitable output devices include, but are not limited to, visual output devices, including displays and printers, audio output devices, including speakers, headphones, earphones, and alarms, and haptic output devices, including force-feedback game controllers and vibrating devices.
The processor 210 is further coupled to a modem 250 and a transceiver 260. Together, the modem and transceiver form a network interface. The modem 250 and transceiver 260 prepare data generated by the processor 210 for wireless transmission over the network according to one or more network communication standards. The modem 250 and transceiver 260 also demodulate data received over the network according to one or more network communication standards. The transceiver can include a transmitter 262, a receiver 264, or both. In other embodiments, the transmitter and receiver are two separate components. The modem 250 and transceiver 260, can be embodied as a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any suitable combination thereof designed to perform the functions described herein.
The user device 200 and components thereof are powered by a battery 280 and/or an external power source. The battery 280 can be any device that stores energy, and particularly any device which stores chemical energy and provides it as electrical energy. The battery 280 can include one or more secondary cells including a lithium polymer battery, a lithium ion battery, a nickel-metal hydride battery, or a nickel cadmium battery, or one or more primary cells including an alkaline battery, a lithium battery, a silver oxide battery, or a zinc carbon battery. The external power source can include a wall socket, a vehicular cigar lighter receptacle, a wireless energy transfer platform, or the sun.
In some embodiments, the battery 280, or a portion thereof, is rechargeable by an external power source via a power interface 290. The power interface 290 can include a jack for connecting a battery charger, an inductor for near field wireless energy transfer, or a photovoltaic panel for converting solar energy into electrical energy.
In some embodiments, the user device 200 is a personal computer, a game console, a mobile telephone, a personal data assistant (PDAs), a GPS receiver/navigator, a camera, an MP3 player, a camcorder, a wrist watch, a clock, or a television.
As mentioned above, the system 100 of
Users waiting for the criteria for stating the multiplayer game to be met may become bored or disengaged from the game, particularly as the wait time increases. By adding a queuing game to the staging screen, or accessible from the staging screen, users are able to continue interacting with the system while waiting to begin a multiplayer game. In one embodiment, the queuing game is single-player game, whereas in another embodiment, the queuing game is also a multiplayer game, playable between multiple users awaiting criteria for starting the awaited multiplayer game to be met.
The queuing game can engage users in active participation, thereby reducing disengagement and boredom. In one embodiment, to further engage users, the queuing game results in a queuing game outcome which affects the awaited multiplayer game. For example, the user with the highest queuing game score could be selected to choose an option for the multiplayer game when it is to begin. As another example, each user may be awarded a variable advantage (health, credits, preferable starting location) based on his or her queuing game score.
The staging screen 400 also includes a queuing game area 430 in which a queuing game is presented to the user. The queuing game area 430 can include an active gaming area 432 where the user inputs gaming commands and a passive gaming area 434 which indicates, for example, a queuing game score. In
In one embodiment, the host device, exemplified by user device 200 of
Next, in block 520, it is determined whether the criteria for beginning the multiplayer game have been met. The determination can be performed, for example, by the processor 210 of
In one embodiment, the criteria includes a criterion that a predetermined time has elapsed. For example, if any player has been queued for more than ten minutes, it can determined that the criterion has been met. The described criteria can be combined in any number of ways, including determining that at least one of a plurality of criteria are met or all of a plurality of criteria are met. For example, it can be determined that the criteria are met if either four players are queued or any player has been queued for more than ten minutes.
In one embodiment, the criteria includes a criterion that another multiplayer game has concluded. For example, if a host device can only host a predetermined number of multiplayer games due to limited resources, the criterion may only be met when less than the predetermined number of multiplayer games are in session. This criterion may also be used in a tournament mode. For example, in a single-elimination tournament, a first and second player may be matched in a first semi-final round and a third and fourth player may be matched in a second semi-final round. When the first semi-final round is completed, the winner of the match is queued for final round until the second semi-final round is completed. During this time, the winner can be presented with queuing game, as described below, until the criterion is met that the other multiplayer game (the second semi-final round) has concluded.
If it is determined that the criteria for beginning the multiplayer game are not met, the method 500 continues to block 530 where a queuing game is presented. The queuing game can be begun, and further presented, by host device 110 of
Any number of games can be utilized for the queuing game. In one embodiment, the queuing game is a puzzle game, such as a match-3 style game or a hidden picture game. In another embodiment, the queuing game is a shooting gallery game, which may utilize a portion of the game software for the multiplayer game. In particular, the queuing game may be related to the multiplayer game. For example, the queuing game can be a sparring match where the multiplayer game is a fighting game. As another example, the queuing game can be a penalty kick simulation wherein the multiplayer game is a soccer game. In another embodiment, the queuing game is a card game, such as solitaire or Hearts. The queuing game can be a multiplayer game played by a single player against computer-controlled opponents.
In one embodiment, the queuing game is characterized by relatively simple gameplay. For example, the queuing game may only allow user input to include a cursor location and a button-click input.
In one embodiment, the queuing game is characterized by frequent scoring events, such that when the multiplayer game begins, the interruption of the queuing game (in block 540, described below) does not disadvantage the player. In one embodiment, scoring events can occur at a rate of greater than once a minute, greater than five times a minute, or greater than ten times a minute.
In one embodiment, the queuing game is characterized by a continuously changing score, like a timer. For example, the queuing game may require a user to move an avatar to avoid objects and the score is the time elapsed from the beginning of the queuing game to when the avatar touches an object.
While the queuing game is in progress, the method 500 continually or periodically cycles through blocks 520 and 530 to determine whether the criteria for beginning the multiplayer game have been met. During the time, an indication of the criteria not yet met is displayed to the user as part of the queuing game or on a separate portion of the screen.
If it is determined that the criteria for beginning the multiplayer game have been met, the method 500 continues to block 540 where the queuing game is ended. Ending the queuing game can be performed, for example, by the processor 210 of
The method 500 continues to block 550 where a queuing game outcome is determined. The queuing game outcome can be determined, for example, by the processor 210 of
Next, in block 560, the multiplayer game is presented to and played by the queued users. The multiplayer game can be presented by, for example, the host device 110 of
In one embodiment, the multiplayer game is based, at least in part, on the queuing game outcome. For example, if the queuing game outcome is a queuing score, the queuing game player can be awarded a variable advantage (health, credits, preferable starting location) at the beginning of the multiplayer based on the queuing game score. As another example, if the queuing game outcome is a determination of the player with the highest queuing game score, the multiplayer player game can be based on a selection received from that player. For example, the user can select a map or a rule set to be used in the multiplayer game.
In another embodiment, teams of the multiplayer game are assigned based on the queuing game outcome. For example, if the queuing game is a shooting gallery game and the queuing game outcome for each player is an accuracy, teams may be balanced by assigning an approximately equal number of high accuracy and low accuracy players on each team.
Once the multiplayer game has completed for a particular player, the method can end or return to block 510 by queuing the particular player for a next multiplayer game.
In one embodiment, the method 500 repeats for a number of multiplayer games based one respective queuing game outcomes for each of one or more players. In a current iteration of the method 500, the multiplayer game is based, at least in part, on the prior multiplayer games. For example, if a particular map for a multiplayer game is relatively unused as compared to other maps, the queuing game can include that particular map as part of treasure hunt style game. In this example, use of the particular map could give queuing game players familiarity with the map and lead to greater usage of that map in the multiplayer game.
While the above description has pointed out novel features of the invention as applied to various embodiments, the skilled person will understand that various omissions, substitutions, and changes in the form and details of the device or process illustrated may be made without departing from the scope of the invention. Therefore, the scope of the invention is defined by any presented claims rather than by the foregoing description. All variations coming within the meaning and range of equivalency of presented claims are embraced within their scope.
| Number | Name | Date | Kind |
|---|---|---|---|
| 20020198045 | Okubo | Dec 2002 | A1 |
| 20060116189 | Tessmer et al. | Jun 2006 | A1 |
| 20060121971 | Slomiany et al. | Jun 2006 | A1 |
| 20080274796 | Lube | Nov 2008 | A1 |
| 20080311980 | Cannon | Dec 2008 | A1 |
| 20090011827 | Englman et al. | Jan 2009 | A1 |
| 20090280891 | Filipour et al. | Nov 2009 | A1 |
| 20100113162 | Vemuri et al. | May 2010 | A1 |
| 20100227679 | Konishi et al. | Sep 2010 | A1 |
| Number | Date | Country | |
|---|---|---|---|
| 20120040752 A1 | Feb 2012 | US |
