Conditional access to areas in a video game

Information

  • Patent Grant
  • 9808721
  • Patent Number
    9,808,721
  • Date Filed
    Tuesday, November 10, 2015
    9 years ago
  • Date Issued
    Tuesday, November 7, 2017
    7 years ago
Abstract
A video game includes conditional access to areas of the game. An area may be unlocked when particular game characters are at an entrance to the area. An area may be unlocked for a particular character, for all characters, or for categories of characters. Categories of characters may include characters of a particular type, characters of a particular skill level, characters controlled by a particular game player, and characters previously played in the video game.
Description
BACKGROUND OF THE INVENTION

The present invention relates generally to video games, and more particularly to controlling access to areas in a video game.


Video games provide enjoyment for many. Video games allow game players to participate in a variety of simulated activities, including those that the game players may not be able or desire to experience directly, whether due to cost, danger, or equipment concerns, or simply due to the activity or its surroundings being in the realm of fantasy.


Video games may provide many virtual areas that virtual characters under the control of game players may access. Some of the virtual areas may require the game character to perform particular actions. In a multicharacter or a cooperative multiplayer game, however, repetitively requiring different game characters to perform the game particular actions may detract from game play enjoyment.


BRIEF SUMMARY OF THE INVENTION

In aspects the invention provides conditional access to areas of a video game.


Another aspect of the invention provides a computer implemented method for use in providing a video game, comprising: determining whether an area of the video game should be unlocked; when the area of the video game should be unlocked, determining at least one game character for which the area of the video game should be unlocked; and unlocking the area of the video game to the determined at least one game character.


Another aspect of the invention provides a non-transitory machine-readable medium for a video game, the machine-readable medium comprising program instructions for: determining whether an area of the video game should be unlocked; determining an extent of unlocking for the area of the video game when the area of the video game should be unlocked; and unlocking the area of the video game to the determined extent.


These and other aspects of the invention are more fully comprehended upon study of this disclosure.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1 is an example of a video game system in accordance with aspects of the invention;



FIG. 2 is an example block diagram of video game console in accordance with aspects of the invention;



FIG. 3 is a diagram of areas in a video game in accordance with aspects of the invention;



FIG. 4 is a flowchart of a process for determining if a game area should be accessible to game characters, and which game characters, in accordance with aspects of the invention; and



FIG. 5 is a flowchart of a process for conditionally unlocking access to an area of a video game in accordance with aspects of the invention.





DETAILED DESCRIPTION


FIG. 1 is an example of a video game system in accordance with aspects of the invention. The video game system includes a video game console 111 with a processor for executing program instructions providing for game play, user input devices such as a video game controller 115, a display device 123, and a reader 143. The processor, responsive to inputs from the user input devices and in some embodiments the reader, generally commands display on the display device of game characters in and interacting with a virtual world of game play and possibly each other.


The instructions providing for game play are generally stored on removable media, for example an optical disk. Accordingly, the game console may include an optical drive, for example a DVD-ROM drive, for reading the instructions for game play. In some embodiments, the game console may be instead a personal computer, or a notebook or netbook computer, including, in some instances, a built-in display and built-in or attached user input devices.


The display device is generally coupled to the game console by a cable, although in some embodiments a wireless connection may be used. In many embodiments, the display device is a liquid crystal display. In some embodiments, the display device is a television. A display screen 131 of the display device displays video images of game play, generally as commanded by the processor or other associated circuitry of the game console. In the embodiment of FIG. 1, the display screen shows a screen shot of video game play. As illustrated, the screen shot shows a display of a game character, generally controlled by and animated in accordance with user inputs, approaching what may be considered a castle.


The reader, in some embodiments and as shown in FIG. 1, has a substantially flat upper surface for placement of objects thereon. The reader circuitry detects the presence of a machine readable identifier on or about the reader, with the reader including reader circuitry, for example RFID reader circuitry, optical recognition circuitry, or other reader circuitry, processing circuitry in some embodiments, and communication transmitter or transceiver circuitry for accomplishing this task. The processing circuitry may execute instructions according to firmware that is also stored in the reader. The processing circuitry may control operation of the reader circuitry, and also process signals from the RFID reader to determine data to be sent to the game console. The communication transceiver included in the reader sends reader data to the game console. The communication transceiver may send data, for example as controlled by the processing circuitry.


The toy figure includes a machine-readable identifier, for example a radio frequency identification (RFID) tag or a bar code that may be sensed or read by the reader. The machine-readable information may include an identifier identifying the game character. The machine-readable information allows the reader, or the processor of the game console, to distinguish one toy figure from other toy figures, and the machine-readable information may also include information relating to a variety of aspects of the game character, and, in some embodiments, information about an owner of the toy figure. For example the machine readable information, which in some embodiments is also writeable, may include information relating to a level of the game character, items in the game characters possession, items worn by the game character, an owner of the game character, and other matters. In some embodiments each particular toy figure may have its own separate identifier, for example two otherwise identical toy figures may each have a unique identifier. In some embodiments, however, identical game objects may have the same identifier, and in other embodiments similar game objects may have the same identifier.


A game player generally places game objects, for example a toy figure 145 on the flat surface of the reader during game play. In many cases the toy figure is in the form of and representative of a game character of the game, for example the dragon of FIG. 1. When a toy figure is placed on the reader, the game character represented by the toy figure appears in the game and is added to game play. In most embodiments, while the toy figure is placed on the reader, the game console may, through the receipt of user inputs for example, allow for control of the game character during game play, with the game console determining game character actions and resulting game states and commanding display of game play reflecting game states on the display, which displays the game play.


During game play the game player generally controls the game character, and causes the game character to move about a game defined world, undertaking various adventures and performing various tasks, with game play displayed on the display. The game world includes multiple game areas where the game character may be located. Access to some of the areas may be limited to certain game characters. Passage into game areas may be allowed or disallowed based on, for example, past actions by the character, a type of the character, or a game player with which the character is associated.



FIG. 2 is an example of a block diagram of a processor and associated circuitry, for example for a game console, useful in accordance with aspects of the invention. As shown in FIG. 2 a processor 211 is connected to other components via a bus. The other components include a main memory 213 and a removable memory interface 215 generally coupled to a removable memory device, for example, a DVD-ROM drive. The processor may execute instructions from the removable memory device to control game play and store game state information in the main memory. For example, the instructions may be for determining possible movements, positions, and locations of the game character.


The processor is coupled to an audio driver 221 and a video driver 223. The audio driver produces sound signals and the video driver produces image signals. The sound signals and image signals are transmitted from the game console via a display I/O device 225. The display I/O device generally supplies the sound and image signals to a display device external to the game console.


The processor may also be coupled to a user I/O device 217, a wireless transceiver 219, an Internet I/O device 227, and other circuitry 229. The user I/O device may receive signals from an RF reader and/or signals from a keyboard, a mouse, and/or a game controller, with generally the keyboard, mouse, and/or controller being used by a user and providing user inputs, for example during game play. Alternatively or additionally, the personal computer may receive user inputs via the wireless transceiver. The Internet I/O device provides a communication channel that may be used, for example, for multiple player games.



FIG. 3 is a diagram of areas in a video game in accordance with aspects of the invention. The video game includes multiple game areas where players may use their game characters. The areas may include different objects, challenges, and the like. Passage into the areas is restricted by entrances that may conditionally allow or disallow a character to enter the area.


The example video game illustrated in FIG. 3 includes a main or initial area 301. Game characters may generally begin game play in the initial area. Characters in the initial area may move from the initial area to a first area 311 by way of a first entrance 312. The first entrance limits passage to the first area by allowing or disallowing characters to pass through the entrance. Passage may be allowed based, for example on the identity of the character, the type of character, or past game experiences of the characters. When an entrance allows a character to pass into an area, the area is accessible to that character and the area may be considered unlocked with respect to that character.


Characters may also move from the initial area to a second area 321 by way of a second entrance 322. The second entrance limits passage to the second area in a manner similar to that of the first entrance. The determination of whether the entrances allow passage is generally independent for each entrance. Additionally, in some embodiments an area may have multiple entrances and whether the multiple entrances allow passage may be determined jointly or independently. Similar to passage from the first area to the second area by way of the second entrance, a character may pass from the second area to a third area 331 by way of a third entrance 332.


Characters may also move to one of two isolated areas 341, 351. Passage to the isolated areas is allowed or disallowed by corresponding entrances 342, 352. Characters may move or locate to the isolated area, for example by helicopter.



FIG. 4 is a flowchart of a process for determining if a game area of a game world of a video game should be accessible to game characters and, if so, which game characters. The process of FIG. 4 may be performed, for example, by the game console of FIG. 1 or the processor, for example as configured by program instructions, in conjunction with associated circuitry, of FIG. 2.


In block 411 the process determines whether a character of the video game is in an entrance to an area. A character may be in the entrance to the area, for example, if the process receives information that a character has been read by a reader capable of reading character related information, for example in embodiments that utilize an RFID reader and toy figures with RFID transmitters, and game play is located at the entrance. Game play may be located at the entrance, for example, if display of game play shows the character at or about the entrance. A character may also be in the entrance to the area when the character has moved to the entrance, for example as commanded by game player input, provided for example by a game controller, with game play status indicating that the character is at the entrance. The process returns to block 411 if a character is not in the entrance to the area; otherwise, if a character is in the entrance to the area, the process continues to block 413.


In block 413 the process determines whether the character at the entrance to the area is an appropriate character for unlocking access to the area. It may be appropriate to unlock access depending, for example, on the type of the character, a performance level or game stage of the character, possessions of the character, tasks performed by the character, or combinations thereof. The process returns to block 411 if the character at the entrance to the area is not an appropriate character for unlocking access to the area; otherwise, if the character at the entrance to the area is an appropriate character for unlocking access to the area, the process continues to block 415.


In block 415 the process determines a set of characters for whom the area should be accessible. In various embodiments the set of characters may be based on characteristics of the character triggering the unlocking or may be based on status of game play. In some embodiments the set of characters is global, in other words all characters. In other embodiments the set of characters is based on a type of the character or a game level of the character. In other embodiments the set of characters is based on which characters have been played by the game player associated with the character triggering the unlocking. In other embodiments the set of characters is provided from a source external to the video game, such as an Internet server. The set of characters indicates which characters may enter the area.


In block 417 the process unlocks the area for the set of characters determined in block 415. The process may unlock the area by setting state information, which may be stored for example in memory of the game console, of the game associated with the area being unlocked. For example, the process may set attributes of an entrance to the area indicating which characters are allowed to pass through the entrance into the area. Additionally, the process may command display, and in some embodiments display a message to a game player indicating which characters may enter the area.


The process thereafter returns.



FIG. 5 is a flowchart of a process for conditionally unlocking access to an area of a video game. The process of FIG. 4 may be performed, for example, by the game console of FIG. 1 or the processor, for example as configured by program instructions, in conjunction with associated circuitry, of FIG. 2.


In block 511 the process determines a type of unlocking of access to the area. In some embodiments only one type of unlocking may be available, and in such embodiments the process may dispense with performing the functions of block 511. The type of unlocking may be determined based on characteristics of a character triggering the unlocking of the area. The type of unlocking may vary with which area is being unlocked and may vary at different times during game play. For example, the type of unlocking may be determined using a process as illustrated in FIG. 4. The process continues to block 521 if the type of unlocking is global. The process continues to block 531 if the type of unlocking is character based. The process continues to block 541 if the type of unlocking is player based. The process continues to block 551 if the type of unlocking is for specific characters. The process continues to block 561 if the type of unlocking is based on an external source.


In block 521 the process unlocks the area for all game characters. The process thereafter returns.


In block 531 the process determines whether character based unlocking is by type or level. The process continues to block 532 if the unlocking is for characters of a certain type; otherwise, process continues to block 533 if the unlocking is for characters of a certain level. In block 532 the process unlocks the area for characters types that match the type of the character that triggered the unlocking. In some embodiments, there is a hierarchy of character types, for example as genus and species, and the unlocking may be for characters of the same genus or of the same species. In block 533 the process unlocks the area for characters at levels at or above a certain level. In other embodiments the area may be unlocked for characters below a certain level. The level may be determined, for example, using the level of the character that triggered the unlocking or determined based on the area being unlocked. The process thereafter returns.


In block 541 the process determines whether the player based unlocking is for played or unplayed characters. The process continues to block 542 if the unlocking is for played characters; otherwise, process continues to block 543 if the unlocking is for unplayed characters. In block 542 the process unlocks the area for characters that the player whose character triggered the unlocking has previously played in the video game. In block 543 the process unlocks the area for characters that the player has not yet played in the video game. In various embodiments the character that triggered the unlocking may be included in or excluded from the characters for which the area is unlocked. The process thereafter returns.


In block 551 the process unlocks the area for a subset of game characters. The subset of characters may be based on a common characteristic of the characters, for example characters considered to be a team, characters present on a reader, or characters that have a same pre-identified characteristic. The process thereafter returns.


In block 561 the process unlocks the area for the character that triggered the unlocking. In block 562 the process transmits a request for additional information about which characters should be included in the unlocking of the area. The request may be transmitted, for example, to an Internet-connected server that provides information related to the game or characters in the game. The request may be transmitted, for another example, to an Internet connected game server that coordinates game play between remotely located game players. In block 563 the process receives the information requested in block 562. In some embodiments the process may include a timeout if the requested information is not promptly received. The various embodiments the process may retransmit the request for information. When the requested information is not received, the process may perform a default action, such as unlocking the area for subset of characters or the process may return. In block 564 the process unlocks the area for the game characters indicated in the information received in block 563. The information may indicate game characters, for example, by specific identities or characteristics. The process thereafter returns.


The process may, in other embodiments, include additional types of unlocking or may combine features of the types illustrated in FIG. 5. For example, the process may unlock an area for characters of a certain type and that have been previously played in the game. Additionally, in some embodiments, game players may trade characters and the process accordingly may determine whether access to an area changes when a character is owned by a different game player. When the area was previously unlocked, the process may add characters to the unlocking or may remove the previous unlocking.


Aspects of the invention provide for animation routines for game characters. Although aspects of the invention have been described with respect to various specific embodiments, it should be recognized that the invention comprises the novel and non-obvious claims supported by this disclosure.

Claims
  • 1. A computer-implemented method for determining whether a game area of a game world is accessible to game characters, comprising: using a reader with RFID reader circuitry to read machine-readable information stored in one or more toys, the machine-readable information including information identifying corresponding one or more game player controllable video game characters, the reader including a surface for placement of the one or more toys;presenting a game world having a plurality of game areas, each of said plurality of game areas having at least one entrance to said, at least two of said plurality of game areas directly joined by at least one entrance together, and at least one of said plurality of game areas isolated from the other game areas and not directly joined to any other game area;determining whether a game player controllable video game character of the one or more game player controllable video game characters is located at an entrance to a particular area of the game world, the particular area of the game world being one of said plurality of game areas of the game world;when the game player controllable video game character of the one or more game player controllable video game characters is located at the entrance to the particular area of the game world, determining whether the game player controllable video game character being present at the entrance to the particular area of the game world is allowed passage through the entrance to the particular area of the game world, said determining being based at least in part on a determination that the game player controllable video game character at the entrance to the particular area of the game world is of a particular type of game character;allowing passage through said entrance to the particular area of the game world for a plurality of game player controllable video game characters upon determining that the game player controllable video game character being present at the entrance to the particular area of the game world is allowed passage through said entrance; andwherein the plurality of game player controllable video game characters allowed passage through said entrance to the particular area of the game world comprises a first set of game player controllable video game characters, and wherein the first set of game player controllable video game characters is game player controllable video game characters associated with the one or more toys proximate the reader.
  • 2. The method of claim 1, further comprising commanding display of an indication of which of the plurality of game player controllable video game characters is included in the first set of game player controllable video game characters.
  • 3. The method of claim 1, wherein the plurality of game player controllable video game characters allowed passage through said entrance to the particular area of the game world comprises a second set of game player controllable video game characters, and wherein the second set of game player controllable video game characters is game player controllable video game characters of a type associated with the game player controllable video game character that triggers accessibility of the particular area of the game world.
  • 4. The method of claim 1, wherein the plurality of game player controllable video game characters allowed passage through said entrance to the particular area of the game world comprises a second set of game player controllable video game characters, and wherein the second set of game player controllable video game characters is game player controllable video game characters with a game level at or above a game level of the game player controllable video game character that triggers accessibility of the particular area of the game world.
  • 5. The method of claim 1, wherein the plurality of game player controllable video game characters allowed passage through said entrance to the particular area of the game world comprises a second set of game player controllable video game characters, and wherein the second set of game player controllable video game characters is game player controllable video game characters that a current game player has played in the video game.
  • 6. The method of claim 1, wherein the plurality of game player controllable video game characters allowed passage through said entrance to the particular area of the game world comprises a second set of game player controllable video game characters, and wherein the second set of game player controllable video game characters is game player controllable video game characters that a current game player has not played in the video game.
  • 7. The method of claim 1, wherein the plurality of game player controllable video game characters allowed passage through said entrance to the particular area of the game world comprises a second set of game player controllable video game characters, and further comprising: transmitting a request for additional information about accessibility of the particular area of the game world;receiving the additional information; andincluding game player controllable video game characters indicated by the additional information in the second set of game player controllable video game characters.
  • 8. The method of claim 1, wherein the plurality of game player controllable video game characters allowed passage through said entrance to the particular area of the game world comprises a second set of game player controllable video game characters, and wherein the combination of the first set and second set of game player controllable video game characters includes all game player controllable video game characters.
  • 9. The method of claim 1, wherein the plurality of game player controllable video game characters allowed passage through said entrance to the particular area of the game world comprises a second set of game player controllable video game characters, and wherein the second set of game player controllable video game characters is game player controllable video game characters in a same subset as the game player controllable video game character at the entrance to the particular area of the game world.
  • 10. The method of claim 9, wherein the subset comprises the game player controllable video game characters associated with the one or more toys proximate the reader.
CROSS-REFERENCE TO RELATED APPLICATION

The present application is a continuation of U.S. patent application Ser. No. 13/109,926, filed May. 17, 2011, the disclosure of which is incorporated by reference herein.

US Referenced Citations (131)
Number Name Date Kind
4840602 Rose Jun 1989 A
5413355 Gonzalez May 1995 A
5533920 Arad et al. Jul 1996 A
5661470 Karr Aug 1997 A
5752880 Gabai et al. May 1998 A
5766077 Hongo Jun 1998 A
5810666 Mero et al. Sep 1998 A
5853327 Gilboa Dec 1998 A
5873765 Rifkin et al. Feb 1999 A
6056618 Larian May 2000 A
6083073 McFarlane et al. Jul 2000 A
6167353 Piernot et al. Dec 2000 A
6290565 Galyean, III et al. Sep 2001 B1
6354947 Dobrusskin et al. Mar 2002 B1
6491566 Peters et al. Dec 2002 B2
6544097 Bain Apr 2003 B1
6709336 Siegel et al. Mar 2004 B2
6729934 Driscoll et al. May 2004 B1
6737957 Petrovic et al. May 2004 B1
6761637 Weston et al. Jul 2004 B2
6773325 Mawle et al. Aug 2004 B1
6773326 Jarvis Aug 2004 B2
6796908 Weston Sep 2004 B2
6905391 Soto et al. Jun 2005 B2
6965298 Feinberg Nov 2005 B2
6967566 Weston et al. Nov 2005 B2
7001276 Shinoda Feb 2006 B2
7066781 Weston Jun 2006 B2
7081033 Mawle et al. Jul 2006 B1
7244183 England Jul 2007 B1
7297063 Fujisawa et al. Nov 2007 B2
7331857 MacIver Feb 2008 B2
7338377 Shinoda Mar 2008 B2
7387559 Sanchez-Castro et al. Jun 2008 B2
7425169 Ganz Sep 2008 B2
7465212 Ganz Dec 2008 B2
7488231 Weston Feb 2009 B2
7500917 Barney et al. Mar 2009 B2
7502759 Hannigan et al. Mar 2009 B2
7524246 Briggs et al. Apr 2009 B2
7534157 Ganz May 2009 B2
7568964 Ganz Aug 2009 B2
7604525 Ganz Oct 2009 B2
7614958 Weston et al. Nov 2009 B2
7618303 Ganz Nov 2009 B2
7677948 Ganz Mar 2010 B2
7789726 Ganz Sep 2010 B2
7808385 Zheng Oct 2010 B2
7843471 Doan et al. Nov 2010 B2
7846004 Ganz Dec 2010 B2
7850527 Barney et al. Dec 2010 B2
7862428 Borge Jan 2011 B2
7878905 Weston et al. Feb 2011 B2
7883416 Dobrusskin et al. Feb 2011 B2
7883420 Bradbury et al. Feb 2011 B2
7909697 Zheng Mar 2011 B2
7982613 Zheng Jul 2011 B2
8066571 Koster et al. Nov 2011 B2
8157611 Zheng Apr 2012 B2
20020077182 Swanberg Jun 2002 A1
20030037075 Hannigan Feb 2003 A1
20030076369 Resner et al. Apr 2003 A1
20030190940 Gordon Oct 2003 A1
20040143852 Meyers Jul 2004 A1
20040214642 Beck Oct 2004 A1
20050059483 Borge Mar 2005 A1
20060273909 Heiman Dec 2006 A1
20070015588 Matsumoto et al. Jan 2007 A1
20070088656 Jung Apr 2007 A1
20070093172 Zheng Apr 2007 A1
20070143679 Resner Jun 2007 A1
20070191096 Tanaka Aug 2007 A1
20070197297 Witchey Aug 2007 A1
20070211047 Doan et al. Sep 2007 A1
20070250597 Resner et al. Oct 2007 A1
20070256716 Resner et al. Nov 2007 A1
20080085773 Wood Apr 2008 A1
20080140528 Ganz et al. Jun 2008 A1
20080141367 Ganz et al. Jun 2008 A1
20080153594 Zheng Jun 2008 A1
20080163055 Ganz et al. Jul 2008 A1
20080214253 Gillo et al. Sep 2008 A1
20080274805 Ganz et al. Nov 2008 A1
20080274806 Ganz et al. Nov 2008 A1
20080274811 Ganz et al. Nov 2008 A1
20080275789 Ganz et al. Nov 2008 A1
20090005139 Morimoto Jan 2009 A1
20090053970 Borge Feb 2009 A1
20090054155 Borge Feb 2009 A1
20090063271 Ganz et al. Mar 2009 A1
20090106671 Olson et al. Apr 2009 A1
20090116641 Bokor May 2009 A1
20090124165 Weston May 2009 A1
20090132267 Ganz May 2009 A1
20090132357 Ganz May 2009 A1
20090132656 Ganz May 2009 A1
20090137185 Zheng May 2009 A1
20090150418 Shuster Jun 2009 A1
20090157876 Lection Jun 2009 A1
20090158210 Cheng et al. Jun 2009 A1
20090204420 Ganz Aug 2009 A1
20090204908 Ganz et al. Aug 2009 A1
20090228557 Ganz et al. Sep 2009 A1
20090234948 Garbow et al. Sep 2009 A1
20090235191 Garbow et al. Sep 2009 A1
20090240659 Ganz et al. Sep 2009 A1
20090248544 Ganz Oct 2009 A1
20090254434 Ganz et al. Oct 2009 A1
20090307609 Ganz et al. Dec 2009 A1
20090309891 Karkanias et al. Dec 2009 A1
20090318234 Christensen et al. Dec 2009 A1
20100042486 Borst et al. Feb 2010 A1
20100058235 Borst Mar 2010 A1
20100107214 Ganz Apr 2010 A1
20100151940 Borge Jun 2010 A1
20100161443 Ganz et al. Jun 2010 A1
20100167623 Eyzaguirre et al. Jul 2010 A1
20100216553 Chudley et al. Aug 2010 A1
20100293473 Borst et al. Nov 2010 A1
20100325182 Ganz Dec 2010 A1
20110086702 Borst et al. Apr 2011 A1
20110165939 Borst et al. Jul 2011 A1
20110190047 Ganz Aug 2011 A1
20110265018 Borst et al. Oct 2011 A1
20110265041 Ganetakos et al. Oct 2011 A1
20110269540 Gillo et al. Nov 2011 A1
20120015699 Kalvachev Jan 2012 A1
20120021825 Harp et al. Jan 2012 A1
20120077585 Miyamoto et al. Mar 2012 A1
20120172131 Boswell Jul 2012 A1
20120252570 Kwant et al. Oct 2012 A1
Foreign Referenced Citations (1)
Number Date Country
WO 2005050948 Jun 2005 WO
Non-Patent Literature Citations (7)
Entry
Joint Technical Committee ISO/IEC JTC1/SC17, Information Technology, Subcommittee SC17, Final Committee Draft ISO/IEC 14443-3, Identification Cards—Contactless Integrated Circuit(s) Cards Proximity Cards, Part 3: Initialization and Anticollision. Jun. 11, 1999.
Atmel, Requirements of ISO/IEC 14443 Type B Proximity Contactless Identification Codes. Nov. 2005.
Microchip, microID 13.56 MHz Rfid System Design Guide. 2004.
Sonmicro, SM130, SM1013 Evaluation Kit, Mifare Brief Technical Information, SMRFID Mifare v1.0 Software, User Manual, Jun. 2006.
Sun, Raymond. “Activision Patent Applications—Prior Art.” Apr. 9, 2013. Print.
Sun, Raymond. “Patent Portfolio for Skylanders.” Mar. 27, 2013. Print.
U.S. Appl. No. 13/109,926, filed May 17, 2011, Paul Reiche, US 2012-0295700 A1, Office Actions dated Jun. 18, 2012; Sep. 26, 2013; Jun. 18, 2014; Apr. 1, 2015, Notice of Allowance dated Oct. 2, 2015.
Related Publications (1)
Number Date Country
20160059132 A1 Mar 2016 US
Continuations (1)
Number Date Country
Parent 13109926 May 2011 US
Child 14937693 US