Other

Multimedia Games, Inc.

Bally Gaming International, Inc.

Martin Anthony Keane

John R Koza

Clifton E Lind

Jefferson Craig Lind

Joseph R Enzminger

Gary Lee Loebig

Gordon Thomas Graves

Forrest H Bennett, Iii

Brendan M O'Connor

Matthew John Streeter

Naveen Malhotra

David Andre

John Everett Padgett

Jessen Yu

William J Mydlowec

David Michael Brandt

Rodney L Willard

Rodney L Willyard

Signal-processing devices having memristors are described for performing frequency-discrimination functions, amplitude-discrimination functions, and time-oriented functions. In each case, the time-domain behavior of the memristors described herein enables these functions to be performed. In one embodiment, memristance of an arrangement of memristors of a device is, after an initial transitional period, predominantly at a first level if frequency of an input signal of the device is less than a first frequency and predominantly at a second level if the frequency of the input signal is greater than a second frequency.

Signal-processing devices having one or more memristors

Described is a method of constructing prize structures that are particularly useful in gaming systems which can be used to implement various games such as bingo and poker. In particular the described pay structures and game systems can have sufficient granularity such that the outcome or payoff of the game being played can be expanded to provide higher payout amounts as well as closely replicate the payoff of a second game. Included are methods and apparatus for playing bingo games and determining which bingo cards are winners. In addition, methods and apparatus for evaluating or checking each card in a bingo game using a bit marked card technique and vector operations are described.

Bingo apparatus

A method for conducting bingo games includes using a server to collect game play requests from a plurality of electronic player stations. The server determines if a group of the collected game play requests meets one or more predefined conditions for establishing a quorum, and if so conducts a game with the group of game play requests. Even after the game is started, the server continues to collect game play requests in preparation for conducting additional games. When enough game play requests are collected, the server starts the next game, even if previous games are still in progress.

Method, system, and program product for conducting multiple concurrent bingo games

Signal processing devices having one or more memristors

A gaming system is disclosed wherein an outcome probability is determined for each of a number of possible outcomes achievable in a wagering game. Different subsets are then associated with each different prize level in a desired prize distribution. The possible outcomes and their respective probability are assigned or mapped to the different subsets so that the probability of achieving a possible outcome included in a subset comprises a value approximating the desired probability of an award of the prize level with which the subset is associated.

Gaming system with modifiable prize distribution assignment method

Method and system for conducting multiple concurrent bingo games

A pattern probability () is determined for each of a number of target patterns () achievable in a bingo-type game. Each pattern probability () comprises a probability of achieving the respective target pattern () in the bingo-type game. Different pattern sets are then associated with each different prize level in a desired prize distribution. The target patterns () and their respective pattern probabilities () are assigned or mapped to the different pattern sets so that the probability of achieving any target pattern included in a pattern set comprises a value approximating the desired probability of the prize level with which the pattern set is associated.

Prize assignment method and program product for bingo-type games

A general automated method for synthesizing the design of both the topology and parameter values for controllers is described. The automated method automatically makes decisions concerning the total number of signal processing blocks to be employed in the controller, the type of each signal processing block, the topological interconnections between the signal processing blocks, the values of all parameters for the signal processing blocks, and the existence, if any, of internal feedback between the signal processing blocks within the controller. The general automated method can simultaneously optimize prespecified performance metrics (such as minimizing the time required to bring the plant outputs to the desired values as measured by the integral of the time-weighted absolute error or the integral of the squared error), satisfy time-domain constraints (such as overshoot, disturbance rejection, limits on control variables, and limits on state variables), and satisfy frequency domain constraints (bandwidth).

Method and apparatus for automatic synthesis of controllers

An apparatus is provided for controlling a system to achieve a specified response. In one embodiment, the apparatus is a proportional, integrative, and derivative (PID) controller having a proportional element, an integrative element, and a derivative element coupled together. The elements respond to a reference signal and generate a control signal that causes a plant to generate a plant output. The proportional element has a gain element where the gain is a function of the ultimate gain of the plant (K) and the ultimate period of the plant (T). The controllers may also be embodied in non-PID controllers that share common elements, such as the use of: (a) Astrom-Hagglund controller output as an input for a subsequent controller; (b) internal feedback; and (c) a subsequent controller that performs a subtraction operation to generate the difference between the output of the Astrom-Hagglund controller and the output of the subsequent controller.

Apparatus for improved general-purpose PID and non-PID controllers

Method and apparatus for automatic synthesis controllers

The present invention is a genetic programming problem solver that automatically generates computer programs to solve problems. The genetic programming problem solver incorporates architecture-altering operations. In one embodiment, the genetic programming problem solver uses architecture-altering operations for automatically defined functions and loops, together with indexed memory, to generate the resulting computer programs. In a second embodiment, the genetic programming problem solver uses architecture-altering operations of automatically defined function, loops, recursions, and stores to generate the resulting computer programs.

Genetic programming problem solver with automatically defined stores loops and recursions

An automated design process and apparatus for use in designing complex structures, such as circuits, to satisfy prespecified design goals, using genetic operations. The present invention uses a population of entities which may be evolved to generate structures that may potentially satisfy the design goals. The behavior of such generated structures is evaluated in view of the design goals, and those structures more closely meeting the design goals are evolved further until a structure is generated that either meets the prespecified design goal or some other process completion criteria. In this manner, a design complex structure may be obtained.

Method and apparatus for automated design of complex structures using genetic programming

A lottery-type game is played with a first level game and at least one second level or additional level game. The first level game includes a plurality of first level game records, each having an associated outcome. At least one outcome is a negotiable outcome. The second level game is related to the negotiable outcome of the first level game and includes a plurality of second level game records. According to the present gaming method, a player is enabled to view a first level game representation associated with a particular one of the first level game records. This first level game representation indicates the outcome associated with the particular first level game record. When this first level outcome is the negotiable outcome, the player may choose to view a second level game representation which indicates the outcome of a particular one of the second level game records.

Multi-level lottery-type gaming method and apparatus

A gaming machine produces truly random results using a noisy oscillator to randomly vary the frequency of a clock signal used to cycle a counter through its states. Multiple random numbers can be generated during the same game using the same circuitry, yet still achieve truly random results.

Growing community of inventors

Chicago, IL, United States of America

Martin Anthony Keane