Tracking system for dice-based board games
By setting up a grid on the game scene and using lookup tables TN(dN) and VN(dN), combined with electronic devices and external equipment, the problem of tracking the position and orientation of multi-faceted dice in the game scene was solved, achieving accurate position and orientation tracking in traditional and hybrid board games, thus improving the gaming experience.
Patent Information
- Application Number
- CN202580028776.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2024-04-17
- Filing Date
- 2025-04-11
- Publication Date
- 2026-11-17
AI Technical Summary
Existing electronic dice and sensor-equipped game boards cannot accurately track the absolute position and orientation of polyhedral dice in the game scene, especially during the flipping process. They cannot adapt to traditional game scenes and different types of polyhedral dice, and cannot meet the needs of hybrid board games.
By setting up a grid on the game scene, and combining electronic devices and external equipment, the position and orientation changes of the dice during the flipping process are determined using lookup tables TN(dN) and VN(dN). Gravity/position/attitude sensors and processing units are used to collect and update the position and orientation information of each face of the dice in real time, which is applicable to different types of multi-faceted dice.
It achieves precise position and orientation tracking of multi-faceted dice in the game scene, applicable to traditional and hybrid board games, reducing reliance on expensive sensor-based boards and improving the gaming experience.
Smart Images

Figure CN123125034A_ABST
Abstract
Description
Technical Field
[0001] The subject matter of this invention belongs to the field of board games, particularly those using dice or similar polyhedral-shaped pieces, where these pieces are flipped over on a predetermined game surface during gameplay. More specifically, this invention relates to a system capable of automatically tracking the trajectory of the dice or similar object on the surface, and the gradually changing orientation of the object's faces along that trajectory. This system can conveniently and automatically track the position and orientation of the dice or similar-shaped pieces via remote electronic devices such as personal computers, tablets, smartphones, or game consoles; this system enables the transformation of traditional board games into so-called hybrid board games. Background Technology
[0002] Dice have been used in games since Roman times, but their purpose has evolved over time. Today, this fun element is widely used in various applications and games that require the introduction of randomness. For this purpose, and to address different statistical scenarios and probabilistic situations, dice with different numbers of faces have emerged in recent years, in addition to the traditional cube die. These are typically composed of regular polyhedra or at least isohedrons (i.e., dice with all faces identical). This not only expands the possible combinations of outcomes but also makes it possible to handle various probabilistic scenarios. A typical example is the various shapes of dice used in so-called role-playing games or certain board games, characterized by features including tetrahedrons (pyramids with four equilateral triangle faces), cubes (the traditional shape with six square faces), octahedrons (polyhedra with eight equilateral triangle faces), and icosahedrons (polyhedra with twenty equilateral triangle faces).
[0003] These special polyhedra can be marked with numbers, and sometimes even symbols, and can be used individually or in groups—whether homogeneous or heterogeneous—depending on the specific circumstances, the type of activity / game, the nature of the activity, and the probability of success.
[0004] Game dice are primarily used in so-called tabletop games, where they introduce randomness, typically through manual rolling, and often on a game board. Given this traditional and primary use, some tabletop games have emerged in recent years where dice serve a dual role as both a (traditional) element of randomness and a true game piece; this piece moves within a game scene, ideally (but not necessarily) represented by a board. A prime example is Wonderment Games' 2019 title, *Quad Heroes*, a modular board game based on various scenes where players control cube-shaped heroes who move by "rolling" across the board. At the end of each turn, the hero's move is determined by the face up of the dice. Therefore, in such games, each die is not "rolled" but rather rolls systematically, rotating gradually along different edges (especially those adjacent to the edge currently interacting with the game scene and / or the board), thus fulfilling the dual role of a piece and a random element. In these cases, randomness is determined by the different faces of the dice—as they roll and gradually flip, these faces will acquire specific orientations and positions (including absolute positions and relative positions between different dice) in the game scene according to pre-set game rules.
[0005] In addition to the games mentioned above that require players to manually operate and move and control physical dice by flipping them step by step, the board game industry has seen the emergence of more technological solutions in recent years, including so-called "hybrid" board games. These games, in order to enhance the gaming experience, integrate hardware and software solutions to achieve the connection and coordination between "physical games"—characterized by concrete and manipulable entities—and "virtual games"—which are coordinated software running on devices such as personal computers, tablets, smartphones, game consoles, or interactive gaming systems, responsible for managing game events and rules.
[0006] Such hybrid board games typically utilize and are based on electronic solutions, such as sensor-equipped boards for verifying piece positions, and electronic dice that often integrate automatic detection results and move systems, enabling the transmission of information to the aforementioned computers, smartphones, tablets, game consoles, and similar devices.
[0007] However, the aforementioned techniques are not applicable to developing hybrid versions of games such as Quad Heroes, as mentioned above, nor more broadly to all games that use dice as both a random element and a game piece—that is, by flipping the edges of the dice and moving them within a specific game scenario.
[0008] In fact, to make the above game a hybrid game, the absolute position of the pieces when they move in the scene must be determined, or in some cases their movement trajectory must be determined; in addition, the absolute and relative orientation of all faces of the dice must be determined for each position in the trajectory—but the patent described in US Patent 2022 / 274009 A1 only relates to the remote transmission of the result of rolling the dice (i.e. the result of a single dice face), and therefore cannot provide the above information.
[0009] In fact, it's important to note that commercial electronic dice, by uniquely returning the result of a roll (usually the face up at the end of the roll), do not accurately provide information about other adjacent faces, especially their orientation relative to the supporting surfaces (usually the board depicting the game scene). This is because such information is completely unnecessary in traditional board games—they simply use the dice as a random element. Take a standard six-sided cube die as an example: due to its structure, knowing the face up (e.g., face 3) automatically tells us the face down (usually face 4, because the die's construction ensures the sum of the numbers on opposite faces is 7). However, this does not automatically and precisely tell us the spatial orientation (left, right, front, back) of the remaining adjacent and opposite faces (1 and 6, 2 and 5). Similarly, while automatic tracking of the absolute position of a die can be achieved through complex and expensive sensor-equipped game boards, or by integrating the components for tracking the die's position into the die itself, this does not provide useful information for determining the absolute orientation of each face of the die. This is because it is well known that two points in a game scene can be reached through various trajectories and flips (e.g., left, front, right, or right, front, left, etc.), and these different trajectories will result in different configurations of the spatial orientation of adjacent faces when the same result (e.g., one face is facing up) is achieved. Summary of the Invention
[0010] To overcome the known limitations of the aforementioned solutions (especially commercial electronic dice and sensor-equipped game boards for detecting pieces), this invention aims to construct a system capable of identifying and tracking the position and orientation of all faces of at least one die that moves in a game scenario and subsequently flips to the edge of its stationary face. This system can acquire, store, and update the position and orientation information of each face of the die during its use in a physical game via appropriate electronic devices (such as personal computers, tablets, smartphones, and similar devices), particularly accurately tracking the aforementioned characteristics of the die in a game trajectory T—which starts from a known initial configuration and evolves randomly through successive flips. More precisely, the goal is to construct a system comprised of a device and its usage method that can flexibly adapt to different game scenarios and different types of physical dice, without requiring an expensive sensor-equipped game board, yet easily adapting to traditional scenarios and game boards, thus achieving its hybridization. The proposed patent is preferably applicable to multi-faceted dice containing N faces (where N∈{4, 6, 8, 20}); said dice are characterized by their faces being triangular or square. Therefore, this system can be easily used to transform traditional board games into hybrid games, based on the principle of flipping dice in the game scene, such as the type of game described in the previous paragraph.
[0011] More precisely, the proposed solution is achieved through a method for having N faces [F1,..., Fs,Fx,..., F...]. N The dice are obtained from a dice tracking system, where N ∈ {4, 6, 8, 20}; the dice move along a preset path T on the surface of the game scene S, and at time point ti, the dice are placed on a face Fs of the scene S that is in contact with the dice at that time. i This is achieved by repeatedly flipping at least one Z-edge; the flipping occurs between two time points [ti, tj]. Before and after each flip, the first face Fs located on the surface of scene S at time point ti is defined. i At time point tj, one of the Z possible adjacent faces Fs on this surface. j State transitions Fs between i → Fs j ; where Z ∈{3, 4}, specifically depending on the shape factor (triangle or square) that represents the N faces of the die.
[0012] The proposed tracking system for dice-based board games can determine two time points [t] before and after each dice roll. i ,t j At position ], the coordinates of the die before and after each roll (X). i Y i ) ti → (X)j Y j ) tj Positional changes between (Dxy) j ).
[0013] The proposed tracking system for dice board games can further determine all faces of the dice [F1, …, Fs, Fx, …, F N The orientation of the [object] is determined for each flip: -At two time points before and after each flip [t] i , t j Within the game scene S, the (adjacent) surfaces Fs that are in contact with it. i 、Fs j ; - The (adjacent) planes Fx in the reference coordinate system XY facing the game scene S, with at least one axis. i Fx j .
[0014] In the proposed system, each time the die is flipped along the edge, the system automatically obtains the stationary surface Fs from the die. i 、Fs j The numerical value. Furthermore, the system at a previous time ti is known to have a face Fx that is fully or primarily (for a triangular die) oriented towards the aforementioned reference frame XY. i The identifier allows for the recursive determination of the flipped state—that is, at time t. j --Towards a new plane Fx in the reference frame XY j The identifier.
[0015] By automatically acquiring and comprehensively analyzing the two surfaces Fs at the instant after the flip. j and Fx j Based on the structural characteristics of the die itself, the orientation of the remaining (N-2) faces of the die can be determined. In fact, it is well known that the N faces of a die [F1,..., Fs, Fx,..., F...] are... N The faces are rigidly connected in a pre-defined, known, and uniquely identifiable manner; therefore, knowing the orientation of at least two faces, Fs and Fx, is sufficient to automatically reconstruct the orientation of all the remaining N-2 faces.
[0016] In other words, the proposed system only needs to know, at the initial time t0, the absolute position of the die at a point (X0,Y0) ∈ S in the game scene, and the initial orientation of each face [F1,..., Fs0, Fx0,..., F NIt can follow the tracked trajectory T and, with each roll of the die (i.e., through two adjacent faces Fs), i With Fs j When transitioning between different points, determine the following data: - Between the two time points [ti, tj] before and after the dice are flipped, each state transition (Xi, Yi) ti → (Xj,Yj) tj During the process, the change in position of the die relative to the reference frame XY (Dxy) j ); -face[F1,..., Fs] i Fx i ,..., F N ]t i → [F1,..., Fs j Fx j ,..., F N ] tj The change relative to the reference frame XY occurs at two time points, before and after the dice are flipped [t]. i , t j The calculation method is as follows: at time point t0, obtain the value of the face Fx0 initially facing the reference frame XY; automatically detect the face Fs0 in contact with scene S from the die; and then, for each transition Fs at subsequent time points... i → Fs j Collect and gradually update the surface F of the contact scene S. s And based on this information, the surface Fx facing the new reference frame XY is automatically calculated. j Information item for Fs j (Collection) and Fx j (Calculation) enables the subsequent acquisition of the full face configuration [F1,…, Fs] at the next moment after flipping, based on the inherent structural characteristics of the mold. j Fx j , …, F N ] tj .
[0017] From a structural perspective, the tracking system for dice-based board games proposed according to the present invention includes the following functional components: - A combination of shape and surface with face F iThe corresponding cells form a grid G. This grid is created by copying the basic shape (triangle or square) that characterizes the N faces of the die, starting from the initial tracking point (X0,Y0)t0 ∈ S; this shape is copied along the same direction (visually, physically, and / or virtually) of the reference coordinate system XY of the game scene S until it completely covers the surface of the game scene S, i.e., satisfying the following relationship (S⊆G); - Applied to the N faces [F1,..., Fs, Fx,..., F N The electronic device for the dice; the device is used to detect the face Fs that contacts the surface of the game scene S, more precisely, to detect the time points [t] before and after each flip. i , t j The surfaces Fs that sequentially contact this surface i 、Fs j ; - A transfer device for a mold having N faces, for remotely transferring the faces Fs i 、Fs j The identifier.
[0018] - An external electronic device equipped with internal memory M, such as (only non-limiting examples) a tablet computer, personal computer, smartphone, video game console, etc., having a device installed on the device for detecting a state change caused by a dice roll, the roll occurring on the face Fs of the currently contacting scene S. i With the Z possible adjacent faces Fs j The state transition resulting from flipping on the edge between two points; where Z ∈ {3, 4}, which depends on the triangular or square shape factor of the N faces of the die used; the detection is performed by sampling face Fs. i The identifier (transmitted by the die at time ti before each roll) and the face Fs j The identifier (determined by the time t after the die is flipped) j This is achieved through transmission. The method enables the stepwise determination—that is, each single transition Fs along the trajectory or path T starting from the point (X0, Y0) ∈ S. i → Fs j At that time, the new position of the die relative to the grid G, and all faces [F1,..., Fs] j Fx j , ..., F N ] In the flipped t j The orientation at any given moment; the position and orientation values of each face of the die are stored in the memory M along the entire tracking path T and updated incrementally.
[0019] In addition to this resolution scheme, it should be noted that the update method essentially includes two lookup tables TN(dN) and VN(dN), which are stored in the memory M of the external electronic device based on the value N (where N ∈ {4, 6, 8, 20}). This allows for the progressive tracking of the position and orientation changes of each face of the die, following each flip Fs of the die along the tracking path T in the game scene S. i → Fs j The tracing begins with the known initial face configuration [F1,..., Fs0, Fx0,..., F] of the die at the initial point (X0,Y0) ∈ S. N The initial configuration is the state of the die at the starting point (X0,Y0) ∈S; the known initial configuration specifically includes: an identifier of the face Fs0 obtained from the die that initially contacts the game surface S (and thus the grid G), and an identifier of at least one of the reference axes XY facing the grid G (primarily applicable to dice with a triangular base).
[0020] Based on this initial configuration, through the update mechanism, it is possible to target two adjacent faces Fs between two time points [ti, tj] before and after the dice roll. i With Fs j For each subsequent flip transition, determine: -The absolute new positions of each face of the die immediately after flipping [F1,..., Fs] j Fx j ,..., F N ] tj The configuration is defined relative to at least one reference axis XY of the mesh G used to define the scene S and a known initial configuration [F1,..., Fs0, Fx0,..., F N ] to - On mesh G, the stationary surface Fs i At time t j Position of time (X) j Y j ) tj This moment belongs to any trajectory T derived from the initial point (X0, Y0) ∈ S; the position (X j Y j ) tj By in each transition (X) i ,Y i ) ti → (X j ,Y j )tj Between these two time points [t] i , t j The new position (X) is located before and after the dice are flipped; j ,Y j ) tj Determined by the following formula: (X) j Y j ) tj = (X i Y i ) ti + (Dxy j ), wherein the deviation (Dxy) j ) is a relative quantity defined relative to the cell of grid G.
[0021] Specifically, the lookup table TN(dN) can be used to determine a face with N faces [F1,..., Fs, Fx,..., F...]. N In two adjacent faces Fs i → Fs j The orientation configuration after a flip occurs; the flip is achieved by detecting changes in the surface of the contact surface S, which are transmitted by the dice to a connected external electronic device, and at two time points [t] before and after the flip. i , t j Sampling is performed.
[0022] More precisely, the first lookup table TN(dN) is derived from all faces [F1, …, F…]. i , F j , …, F N At the initial observation point (X0, Y0) t=0 Starting with the initial configuration at ∈ S, such that the dice are rolled at time interval [t] i , t j Two adjacent faces Fs occur within the [internal area]. i → Fs j When flipping between the two faces, it is possible to determine the new assumed orientation of each face of the die, that is, to accurately identify the following transitions: [F1, …, Fs i Fx i, …, F N ] ti →[F1, …, Fs j Fx j, …,F N ] tj To obtain this result, the lookup table TN(dN) is used for each possible transition Fs.i → Fs j and at time t i The plane Fx facing the reference frame XY i Each configuration provides a new facet Fx i The result at time tj after the flip, when facing the reference frame XY. This lookup table then implements the following recursive function: Fx j = TN (Fs i Fx i , Fs j ) in - Fs i 、Fs j Obtained by external electronic devices through remote detection chips - Transition Fx i → Fx i It starts from the initial chip configuration [F1, …, Fs0, Fx0, …, F N Start by gradually updating the chip's state at the initial point (X0,Y0) ∈ S.
[0023] It is important to note that the dice roll face Fx is relative to the reference frame XY. i Relevant information, and timely updates to this information along the tracking path T, are crucial for resolving the technical issues involved; this is because once this information Fx i And the face Fs located on scene S after being flipped (automatically detected by the dice). j By combining this information, the orientation of the remaining N-2 faces of the die can be determined automatically and accurately. In fact, it is well known that when the geometry of a die with N faces is known, the orientation of all the remaining N-2 faces can be determined simply by knowing the spatial arrangement of two adjacent (non-opposite) faces.
[0024] Therefore, we can conclude that this is due to the following two pieces of information: - Obtained through dice detection at time t j The new surface Fs is in a static state j ; - Obtained by looking up the table TN(dN) at the same time t j A new surface Fx towards the reference frame XY j ; Based on the above structural reasons, the configuration of all remaining N-2 faces of the mold can be determined after each flip. Therefore, during each transition process accompanied by flipping, the configuration of each face [F1,..., Fs] of the mold can be determined. j Fxj ,..., F N ] tj The final configuration.
[0025] The second lookup table, VN(dN), determines the movement of the die on any trajectory T, starting from the initial point (X0, Y0). t=0 ∈ S, and with reference to the cells of grid G. The tracking is achieved by progressively updating the position of the die relative to grid G, when the die is on two adjacent faces Fs. i → Fs j Each time the die is flipped, the flip is detected by the change in the contact area between the die and surface S, which is transmitted by the die to a connected external electronic device, i.e., at two time points [t] before and after the flip. i , t j Sampling is performed.
[0026] More precisely, the lookup table VN(dN) starts from the initial position (X0, Y0). t=0 Starting from ∈ S and referencing the XY axes of grid G, the mold can be positioned on two adjacent faces Fs. i → Fs j Each time the mold is flipped, the offset relative to its previous position is determined; this offset is defined based on the reference system of grid G, i.e., in units of grid cells G, and this offset occurs during the position transition before and after the flip. (X i Y i ) ti → (X j Y j ) tj Therefore, the deviations obtained stepwise from table VN(dN) make it possible to obtain the deviations at each time step [t] i ,t j Both can update the mold's new position. This update is done by placing the die in t i The position at time, i.e. (X) i ,Y i ) ti , and the die on two adjacent faces Fs i → Fs j The change in position (Dxy) determined on grid G after flipping between the two sides. j It is obtained by performing calculations, that is, by applying the following formula: (X j ,Y j ) tj = (Xi ,Y i ) ti + (Dxy j ) Wherein, the deviation (Dxy) j The basic unit (triangle or square) of the grid G is used as the reference. To obtain this result, the table VN(dN) is looked up for each possible transition Fs. i → Fs j and at time t i A plane Fx oriented towards the reference frame XY i Each possible configuration defines the deviation (Dxy) caused by overturning. j The deviation is expressed as a change on grid G, with reference to the XY axis. Its unit is equal to the displacement of a cell (triangle or square) in grid G in one of the allowed directions of motion, which is determined by the displacement of adjacent cells due to overturning.
[0027] It should also be noted that, since the grid G consists of cells whose shape and surface correspond to the face of the die (triangle or square), when these cells are copied according to the XY reference frame, each rotation of the die corresponds to only a single cell movement in the grid G, and this movement is in one of the possible directions of the Z-axis, depending on the adjacent face Fs. j The Z-axis direction; where Z ∈ {3,4}, corresponds to the face Fs on scene S just before the flip. i .
[0028] Furthermore, the briefly disclosed patent covers and claims related methods, namely algorithms for acquiring, managing and updating data (face position and orientation) related to the mold, particularly methods using the aforementioned lookup tables TN(dN) and VN(dN). Attached Figure Description
[0029] Further features and advantages of the proposed technical solution will become more apparent in the following description of a preferred but non-exclusive embodiment, which is shown as a non-limiting example in the accompanying 10 figures, wherein: Figure 1 This demonstrates the technical field involved in this patent, namely, in a game scenario, dice are moved by flipping along one of their edges.
[0030] Figures 2 to 7 This demonstrates the technical problem solved by this patent, namely, tracking dice and their orientation, highlighting the different orientations that the faces of the dice may present: starting from the same starting point, moving along two different trajectories on the game surface S, and finally reaching the same destination.
[0031] Figure 8 A general schematic diagram of the proposed system and its main components are shown.
[0032] Figure 9 A possible hardware implementation for progressively detecting the roll of a die and remotely transmitting the orientation of the die face as it contacts the game scene S is shown in detail.
[0033] Figure 10 An example of step-by-step tracing along a trajectory on the game surface S, based on the proposed solution, is shown.
[0034] Figure 11a , 11b Figure 11c shows examples of three lookup tables TN, which determine the orientation of each face of the die during each rotation based on the different geometries of the die and its number of faces N.
[0035] Figure 12a , 12b Figure 12c shows examples of three lookup tables VN that can track the movement of the die on the grid G with each rotation, depending on the different geometries of the die and its number of faces N.
[0036] Figure 13-16 Possible variations of the embodiments are shown, particularly using the proposed system to track the motion of chips with N=4, 6, 8, and 20 faces, respectively.
[0037] Figure 17-18 Examples of two types of grids are shown, which can be used to track 6-sided dice with a square shape factor, and N=4, 8, and 20-sided dice with a triangle shape factor.
[0038] Figure 19 The algorithm / method used in the proposed tracking system is explained. Detailed Implementation
[0039] Referring to the attached diagram, especially in Figure 1 The scope of the invention is as follows: namely, board games, especially board games comprising a game scene (S), on which one or more pieces or operable elements in the form of dice (100), (110) are moved; each die (100) is moved by means of a time interval [t] i ,t j Inside, along two adjacent faces Fs i 、Fs j The edges between them are repeatedly and progressively flipped, moving on the scene (S); the flipping is the movement of the die (100) on the face Fs currently placed on the scene (S). i With Z possible adjacent faces Fs jThe result of rotation occurring on one of the edges, where Z ∈ {3,4}, depends specifically on the shape factor (triangle or square) used to characterize the N faces of the die used. The die (100) is in Figure 1 The system is illustrated using a non-limiting example—a regular die with N=6 faces—but it should be noted that the proposed system is actually applicable to multiple dice (100), (110), which must be regular polyhedra but may have different shapes and types. The scene (S) is characterized by a Cartesian coordinate system (XY), where at time interval [t] i , t j In each flip that occurs within the [then] period, the flipped die is determined as follows: - Transition Fs when the face is facing the scene (S) i → Fs j - Transition Fx when the face is facing the reference frame (XY) i → Fx i In this context, the proposed system is applicable (to give only a non-limiting example) to a system with N faces [F1, …, Fs, Fx, …, F N Commercial dice, where N∈{4, 6, 8, 20}, are shown, for example, in Figures 13-16 of the accompanying drawings. These figures illustrate several possible forms of the die (130), (150), (160), and (170). In practice, this application can be extended to any die or game element whose shape is, in principle, classified as isohedral or pseudo-isohedral, with faces featuring equilateral or square-triangular shapes. Using the aforementioned die with triangular and / or square faces, movement is made on the game scene (S) according to the technical problem being solved, by repeatedly and progressively flipping along an edge located on the face Fs currently in contact with the game scene (S). i With Z possible adjacent faces Fs j One of them, where Z ∈ {3,4}, depends specifically on the shape factor (triangle or square) used to characterize the N faces of the die used.
[0040] Furthermore, the system is also applicable to dice whose edges may have bevels, as long as they are obtained through the aforementioned flipping action Fs. i , → Fs j The object that moves on the scene, that is, the surface Fs that comes into contact with the scene (S). i With the surface Fs i An adjacent Z-plane Fs j Move between them.
[0041] Based on the aforementioned technical field, the main task of the proposed solution is to provide a board game tracking system that can progressively track N faces [F1,..., Fs, Fx,..., F...]. N Given a die (where N∈{4,6,8,20}) with all faces in the given position and orientation, the die moves along an arbitrary trajectory (T) starting from the initial point (X0,Y0). t0 Starting from ∈ S, that is, for each flip that occurs after the first initial observation time t0, determine when it occurs within the time interval [t]. i , t j [Inside; the system allows determination on each flip:] -Motion of the mold (100) relative to the reference frame (XY): (X i ,Y i ) ti →(X j ,Y j ) tj -The assumed orientation of each face of the die after flipping: [F1, …, Fs i Fx i , …, F N ] ti →[F1, …, Fs j Fx j , …, F N ] tj . Refer to the attached diagram, especially Figures 2 to 7 This diagram illustrates the technical problem solved by the present invention and provides specific examples of the various final orientations that the faces of a die can achieve through different trajectories connecting the same starting and ending points. Therefore, this diagram highlights the technical limitations of simple absolute position tracking systems—common in common tracking systems (such as game boards equipped with sensors, rather than dice position detection systems)—because different trajectories (T1), (T2) exist between two identical points (P1), (P2) in the game scene (S)—even if the results are the same (e.g., the same face facing up or towards the game scene (S)), they may correspond to multiple different spatial orientation configurations of adjacent faces. In specific cases, Figure 2 , 3 4 and Figure 5 , 6 Figures 7 and 8 depict the process of a die with N=6 faces flipping sequentially along two trajectories (T1) and (T2) in a game scene (S); both trajectories begin at the same starting point (P1) and end at the same ending point (P2). The only difference between the two trajectories is the order of the two actions performed: Figure 2 , 3 In step 4, the flip is first forward and then to the left. Figure 5 , 6 In step 7, the rotation first flips to the left and then forward. It can be seen that simply reversing the order of these two minimal actions will result in the final point (P2) – as mentioned above. Figure 4 and Figure 7 As shown, this results in a completely different overall configuration of the dice faces. This allows us to confirm once again that in order to accurately track the trajectory of the die (100) on the game scene (S), the die moves through two adjacent faces Fs. i It moves and flips repeatedly and gradually along the edges between them -- Fs j The dice (100) are repeatedly and progressively flipped along one edge between the edges, so that when moving on the game scene (S), it is not enough to determine the absolute position reached by spatial coordinates alone, but also to accurately map the configuration of all faces of the dice (100) at each flip that occurs on the path (T).
[0042] Refer to the attached diagram, especially Figure 8 The figure depicts the overall working principle of the proposed system, which specifically includes the following: - Two dice (100) and (110), presented as a non-limiting example, in the form of dice with N=6 faces, i.e., square faces; the dice are equipped with electronic devices for detecting the time points [t] before and after each flip. i ,t j During this period, the surfaces Fs that remain on the surface of the game scene (S) in sequence i 、Fs j The device for detecting the face remaining on the game scene (S) may include (only non-limiting examples): a gyroscope, an accelerometer, an inertial switch, and a capacitive sensor. Furthermore, the dice (100) and (110) are also equipped with a wireless transmission device for remotely transmitting signals provided by the aforementioned hardware to an external electronic device (300), and for recognizing the dice face Fs during dice flipping. i 、Fs j This flipping process forms the trajectory (T) on the game surface (S); - A combination of shape and surface with face F i A grid (G) is formed by corresponding cells (201). The grid consists of multiple cells (201) obtained by starting with an initial tracking point (X0, Y0). t0Starting from S, the basic triangular or square shapes of the N faces of the die (100) are copied (as shown in Figure 8). These shapes are copied (visually, physically, and / or virtually) along the same direction of the game scene's reference coordinate system (XY) until they completely cover the surface of the game scene (S), satisfying the relationship (S⊆G). Therefore, the grid (G) can overlap with the game scene (S) and can be specifically implemented in the following form by a non-limiting example: 1. Graphics (directly decorated on the game surface S) 2. Graphics (presented as overlayable additional layers) 3. Luminous effect (created by direct or indirect light source projection or diffusion) 4. Physical effects created through extrusion (through grooves, cuts) 5. Physical effects created through relief (separation lines, superimposed magnetic elements, metal wires).
[0043] - An external electronic device (300), such as (but not limited to) a tablet computer, personal computer, smartphone, video game console, etc., equipped with wireless remote communication means and adapted to receive signals and information from the dice (100), (110). The external electronic device (300) is also equipped with an internal memory (M) containing means for automatically recognizing the transitional states associated with the gradual flipping of the dice (100), (110) on the game surface (S), more specifically, recognizing their flipping to the surface Fs located in the current contact scene (S). i With Z possible adjacent surfaces Fs j The state at the edge between them. Figure 8 In the case shown, the value Z corresponds to 4; however, as reiterated several times previously, according to this patent proposal, for a general die with N faces, the shape factor (triangle or square) of its faces determines Z∈{3,4}. More precisely, the detection of the transition state is achieved by sampling the die (100) at time t before each flip. i The transmitted dice face Fs i The identifier is then used to detect the time t after the die (100) is flipped. j The transmitted dice face Fs j This is achieved through identifiers. Therefore, this method allows for step-by-step determination: that is, along the already traced path (T) starting from point (X0,Y0) ∈ S, at each Fs... i → Fs j During the state transition, the new position of the die relative to the grid (G), and all faces [F1,..., Fs] j Fxj , ...,F N ] tj The orientation of the face of the die (100) during the flip; as the tracking path (T) evolves, the position and orientation information of each face of the die (100) are stored in the memory (M) and updated gradually.
[0044] Refer to the attached diagram, especially Figure 9 The diagram details a possible hardware configuration of the aforementioned electronic device in the proposed die (100) according to the invention, which is used to detect moments [t] before and after each flip along the trajectory (T). i , t j ], and then remain on the surface Fs of the game surface (S). i 、Fs j In a preferred embodiment, these devices take the form of an electronic circuit board (1000) integrated within the die (100), which includes: - A gravity / position / attitude sensor (1001); the sensor includes (by way of a non-limiting example only) an accelerometer, but may be replaced by alternative and functionally equivalent hardware, such as a gyroscope, one or more inertial switches, one or more capacitive sensors, etc. - A processing unit (1002) consisting of a central processing unit (CPU) or replaced by a functionally equivalent device (such as a microcontroller or PIC); - One power battery (1004). - A memory (1003) that maps (usually and preferably in the form of a lookup table) the correspondence between the aforementioned sensor excitation states (e.g., gravity vectors) and the facet orientations corresponding to those states; this correspondence enables the detection of the facet Fs placed on the game scene (S). i 、Fs j . orientation.
[0045] - A remote communication system (1005) that can communicate with the surface Fs i 、Fs j The identification information of these surfaces is transmitted to an external electronic device (300) at the time points before and after each flip [t] i , t j They will stop sequentially on the game scene (S).
[0046] Refer to the attached diagram, especially Figure 10Based on the proposed solution, an example of progressive tracking along a trajectory (T) consisting of a series of flips on a game surface (S) is depicted. Specifically, the figure depicts a series of successive changes (210), (211), (212), (213) of a stationary surface Fs on the game scene (S), the transformations of which are transmitted from the dice (100) to an external electronic device (300) at each flip on the game surface (S), i.e., at each step of the arbitrary trajectory (T), which begins at an initial point (X0, Y0). t=0 ∈ S. During the trajectory (T), the external electronic device (300) progressively updates the known positions of the die (100) and its faces [F1, …, Fs, Fx, …, F N The orientation of the die, and detect two adjacent faces Fs from the same die. i With Fs j Each flip between; the flip is identified by sampling the change in the surface in contact with the surface (S) at two time points [ti, tj] before and after the flip.
[0047] Refer to the attached diagram, especially Figure 11c and Figure 12c The diagram depicts lookup tables TN(dN) and VN(dN), which, according to the invention, are used to track the orientation and movement of a general die with N faces, where N ∈ {4, 6, 8, 20}. As a non-limiting example, Figure 11a , 11b as well as Figure 12a , 12b Specific embodiments of the above lookup table in the cases of N=4 and N=6 are also provided. According to the present invention, the lookup table can be used to track the positions and orientations of the faces of a die (100) as it flips along a trajectory (T) on a game scene (S). Specifically, the tables TN(dN) and VN(dN) can be used to determine and track each flip of the die (100) occurring within the time interval [ti,tj], more precisely: - Motion of the mold (100) relative to the reference frame (XY): (X i ,Y i ) ti → (X) j ,Y j ) tj The motion is achieved through a gradual transition / flipping process relative to surface Fs (Fs i → Fs j It is defined by the asymptotic deviation of the position when in contact with the scene (S); -When the aforementioned flip Fs occurs i → Fsj Then, the dice are rolled on each side [F1, …, Fs]. i Fx i , …, F N ] ti The assumed orientation → [F1, …, Fs j Fx j , …, F N ] tj . Therefore, the lookup table enables the progressive updating of the position and orientation of each facet of a universal die with N faces [F1,..., Fs, Fx,..., FN] at each flip / rotation by flipping along the edge between two faces adjacent to the currently contacting dice facet of the game scene (S). The table or lookup table, based on the different geometries of the dice and the number of its N faces, can be updated at each flip Fs... i Flip to Fs j At that time, its new absolute position (identified by the relative displacement and / or deviation relative to the previously assumed position—i.e., the previously known position) and the new orientation configuration of each face of the die are determined; the new orientation configuration of the N faces of the die is obtained by progressively acquiring the new stationary face Fs with each flip. j And the new face Fx that was subsequently determined j (i.e., the face facing the reference frame (XY) at the next instant after the die is flipped.) The orientation of the remaining faces at the instant after the die is flipped (tj) can be obtained / updated using preset structural constraints (which essentially characterize all commercially available dice known in the prior art) and in conjunction with the face Fs. j and Fx j With a shared understanding, it can be easily deduced that the structural constraints uniquely determine the spatial arrangement of the faces of the commercial dice, and based on this, each face of the dice will take a relative position known in the art and predetermined according to different shape factors and the number of faces N of each specific embodiment of the dice.
[0048] Specifically, in the attached diagram Figure 11a , Figure 11b and Figure 11c Three lookup tables are shown, which allow the face mapping TN(dN) of chips with 6, 4, and more generally N faces to be updated after each flip.
[0049] Similarly, in the attached diagram Figure 12a , Figure 12b and Figure 12cThree lookup tables are shown that update the motion mapping of dice VN(dN) with 6 faces, 4 faces, and more generally N faces, based on the result of each flip. The lookup table VN(dN) specifically defines: during the flip, the new face Fs... j At time t after the flip j The relative deviation from the mesh (G) while stationary on the scene (S), which is relative to the time t before the flip. i The faces Fs that remain on the scene (S) i In terms of position, in Fs i → Fs j During the flipping transition, the position of the dice is updated promptly after each movement, always with the same and aforementioned grid (G) as a reference.
[0050] Therefore, it is important to note that in the above... Figure 11a b, c and Figure 12a In tables a, b, and c, the three lookup tables embody the same solution principle, providing two specific implementations applicable to 6-sided and 4-sided dice, respectively, as well as a more abstract and general example applicable to a general die with N sides.
[0051] In particular, such as Figure 11c The lookup table TN(dN) shown can be used to determine the position of the die (100) on two adjacent faces Fs. i →Fs j Each time the die (100) is flipped, the orientation of its faces is reconfigured; the flipping is detected by an electronic system (300) that monitors only the changes in the stationary faces of the die (100) on the scene (S); the die (100) at two time points before and after the flip [t] i ,t j The sampled data is taken from the initial observation point (X0, Y0). More precisely, the first lookup table TN(dN) is used to sample the data from the initial observation point (X0, Y0). t=0 All faces at point S [F1, …,Fs0, Fx0, …, F N Starting from the known initial configuration of the die, such that the die is on two adjacent faces Fs i → Fs j Each time the die is flipped, the new orientation of each face can be determined; that is, for each time interval [ti, tj], the displacement of each face of the die relative to the reference frame (XY) can be determined. [F1,…, Fs i Fx i, …, F N ] ti →[F1,…, Fs j Fx j, …,FN ] tj To obtain this result, the lookup table TN(dN) is used for each possible transition Fs. i → Fs j , and the surface Fx facing the reference frame (XY) at time ti i For each possible initial configuration, predict and provide the new face Fx i (Still facing the aforementioned reference frame (XY)) at time t immediately following the flip. j The state at that time. Therefore, the lookup table TN(dN) implements the following recursive function: Fx j = TN (Fs i Fx i , Fs j ) in - Fs i 、Fs j Remote inspection by mold (100); - Fx j This can be learned from the previous transition. In fact, the Fx face... i → Fx i The transition is from the initial configuration [F1, …, Fs0, Fx0, …, F N Starting with the known face Fx0 in the [], it is progressively updated to the state assumed at the origin (X0,Y0)t0 ∈ S by the die (100) at the initial point. This allows the identifier of the new face Fx, which is oriented towards the reference frame (XY) and integrated with the scene (S), to be periodically determined and updated in each subsequent transition.
[0052] Based on the proposed system, at the instant after the die (100) is flipped, the direction of 면Fx towards the reference frame (XY) is determined. j This is crucial for determining the orientation of the remaining N-2 faces of the die (100). This is because, as long as the orientation of face Fx is known simultaneously... j and the face Fs of the scene (S) after flipping. j This allows the orientation of all N-2 other faces of the die (100) to be automatically determined. In fact, if the orientation of each face of the die (100) [F1, …, Fs, Fx, …, F] is initially known, then the orientation of all other faces can be determined automatically. NThe geometry and arrangement of the facets are such that knowing the spatial arrangement of at least two adjacent faces—such as [Fs, Fx] in this example—at any time t is sufficient to uniquely determine the orientation of all the remaining N-2 faces, based on obvious structural reasons. For a non-restrictive example, consider a commercial cubic die of N=6, where the faces are distributed in a known manner such that the sum of opposite faces is defined as 7, i.e., according to the following arrangement of opposite faces: (1,6), (2,5), (3,4). Thus, the proposed system determines and updates the following information each time the die (100) is flipped: -New Face Fs j At time t j The state at that time (obtained through mold detection). -New Fx j At the same time t j Facing a reference frame XY (calculated by looking up the table TN(dN)). Based on the above structural reasons, the configuration of the remaining N-2 faces of the die can be obtained, and thus the arrangement of each face [F1,..., Fs] can be derived during each flip transition. j Fx j ,..., F N ] tj The final configuration.
[0053] From a practical application perspective, Figure 11a The tables in , b, and c are divided into sections corresponding to each stationary surface Fs. i The relevant row subsets. Each subset contains all of the following combinations: at flip time t i A possible surface that was previously at rest, and its relationship to that surface Fs. i All adjacent possible Z-planes Fx i --These Z-faces can all face the reference frame (XY) at the same time. In the case shown in Table T6(d6), this Z value corresponds to 4 (this table covers dice with N=6 faces), while in the case shown in Table T4(d4), this Z value corresponds to 3 (this table covers dice with N=4 faces). More generally, according to the proposed patent, the value Z ∈ {3, 4} depends on the triangle or square shape factor that can characterize the N faces of the general die. For each of the above row subsets -- these subsets contain the values at the flip time t i All of the aforementioned possible joint combinations (Fs) i Fx i --Table TN(dN) represents the values of TN(dN) at the flip time t for all possible values. j Subsequently, based on the new stationary surface Fs transferred from the mold (100) to the device (300),j The surface Fx is defined. j The new value will be oriented towards the reference frame (XY) that represents the scene (S) and the mesh (G).
[0054] In practical applications, the rows of the TN(dN) table are determined based on the following: - at the instant before the flip t i The surface Fs at rest i This information is obtained through dice detection; - at the instant before the flip t i The plane Fx facing the reference frame (XY) i This information is known because it is recursively updated with each flip of the die (100).
[0055] Furthermore, the above table TN(dN) is addressed column-wise according to the following principles: - New Face Fs j The instant after the flip t j When at rest, this information is obtained through the detection of the mold (100).
[0056] Therefore, by using the table in this way, the instant t after the mold (100) flips can be automatically obtained. j A new surface Fx for the reference frame (XY) j The relevant information is based on the following recursive formula: Fx j = TN (Fs i Fx i , Fs j ). The information Fx j Combined with the data obtained from the mold (100) at the instant after flipping, t j A new surface Fs at rest j The information allows us to determine the orientation of the remaining faces of the mold (100) based on the aforementioned geometric and structural findings, i.e., all faces of the mold [F1,..., Fs]. j Fx j ,..., F N ] tj The final configuration relative to the reference frame (XY).
[0057] Finally, it is important to note that... Figure 11a Tables in 'b' and 'c' contain undefined cells displayed in gray or black. In fact, these groups of cells relate to what is known as "impossible combination" for some obvious structural reasons, specifically: - The dice (100) at the instant after being flipped t j The side that comes into contact with the game scene (S) obviously cannot be the same as the moment t before the flip. j The side that contacts the game scene (S) is exactly the same, namely Fs i ≠ Fs j ; -As mentioned before, from surface Fs i The faces that can be reached after the initial flip are not all N faces of the die (100), but only a subset of them; this subset consists of the faces Fs. i Defined by Z faces that are adjacent to and therefore share an edge with it. As mentioned earlier, Z ∈ {3,4}, specifically depending on the triangle or square shape factor that can characterize the die (100) according to the proposed patent.
[0058] Special Reference Appendix Figure 12a b, c, are lookup tables V6(d6) and V4(d4) for 6-sided and 4-sided dice respectively, and a more general lookup table VN(dN). All can be used to track the position of the die (100) and, to improve accuracy, can progressively update its position relative to the grid (G); the position is located on two adjacent faces Fs of the die (100). i →Fs j The information is updated with each flip. The flip and relative motion are detected by the change of the surface Fs in contact with the surface (S) transmitted by the die (100) to the external electronic device (300); the die (100) is updated at two time points [t] before and after each flip. i , t j Sampling was performed.
[0059] More precisely, the lookup table VN(dN) starts at the initial position (X0, Y0). t0 Starting from S and referencing the coordinate axes (XY) of the grid (G), it is possible to perform calculations on two adjacent faces Fs. i → Fs j Each flip determines the displacement of the mold (100) relative to the previous position. The offset is defined relative to the reference frame (XY) of the grid (G), i.e., based on the cell (201) that characterizes the grid.
[0060] The proposed system allows updating the position (X) of the die at time ti according to the table VN(dN) on each flip. i ,Y i ) ti → (X j ,Y j ) tjThat is, for time t i Position of time (X) i ,Y i ) ti The positional change (Dxy) calculated from the table VN(dN) is applied. j This change is related to the mold (100) on two adjacent faces Fs. i → Fs j The flip correlation between them is calculated using the following formula: (X j ,Y j )t j = (X i ,Y i )t i + (Dxy j The deviation (Dxy) mentioned above j ) is defined based on the mesh (G) cell (201).
[0061] To obtain this result, the lookup table VN(dN) is used for each possible transition Fs. i → Fs j and surface Fx i For each configuration, the deviation (Dxy) is given. j The value of ) is determined by the following recursive function: (Dxy j ) = VN (Fs i Fx i , Fs j ). The deviation (Dxy) j The offset is represented by the offset of a cell (201) in the grid (G) relative to the reference frame (XY). The offset is defined by a relative increment (+ / -) with a spacing equal to one cell (201). The cell (201) may have a triangular or square shape factor depending on the chip (100) and the corresponding grid (G); thus, the shape factor defines three or four directions of movement allowed during each flip of adjacent cells.
[0062] In fact, it is important to note that since the mesh (G) is composed of cells (201) whose shapes and surfaces correspond to the faces of the mold (100), when these cells are copied according to the reference frame (XY), each rotation of the mold is always related to a certain movement (Dxy) of a single cell (201) in the mesh (G). j The motion occurs in one of Z possible directions, depending on the direction relative to the surface Fs. i Z adjacent possible surfaces Fs jWhere Z ∈ {3,4}.
[0063] From a practical application perspective, Figure 12a The tables in , b, and c are divided into sections corresponding to each stationary face Fs of the die. i The relevant row subsets. Each subset contains all of the following combinations: at flip time t i A surface that may have been stationary at a previous instant, and its relationship to surface Fs. i All adjacent possible Z-planes Fx i --These Z-faces can be oriented towards the reference frame (XY) at the same time. In the case shown in Table V6(d6), this Z value corresponds to 4 (this table covers dice with N=6 faces), while in the case shown in Table V4(d4), this Z value corresponds to 3 (this table covers dice with N=4 faces). More generally, according to the proposed patent, this Z ∈ {3,4}, specifically depending on the triangle or square shape factor that can characterize the N faces of the general die. For each row subset -- these subsets are contained in the flip time t i All of the aforementioned possible joint combinations (Fs) i Fx i -- Table VN(dN) represents the value at the flip time t j All subsequent possible values are based on the new stationary surface Fs passed to the device (300) by the die (100). j , defines t at the instant after the flip j The new stationary surface Fs is passed from the die (100) to the device (300). j Starting from this point, the deviation value (Dxy) that occurs during the flipping process is defined. j This deviation value is a relative value, defined relative to the (triangle or square) cell (201) of the grid (G) and expressed as a relative value (+ / -) relative to the previous position, following the following relationship: (X j ,Y j ) tj = (X i Y i ) ti + (Dxy j ) Therefore, in practical applications, table VN(dN) is addressed row by row according to the following: - The surface Fs that was stationary at time ti before the flip. i This information is obtained through the detection of the dice (100); - The plane Fx facing the reference frame XY at time ti before the flip. iThis information is known because it is updated recursively each time the die (100) is flipped.
[0064] In addition, the column indexes of table VN(dN) are based on the following: - The instant after flipping t j The new face Fs that have stopped j This information is obtained through the detection of the dice (100).
[0065] Therefore, the VN(dN) table processed and used in this way can automatically obtain the deviation (Dxy) j The relevant information is used to determine / update the new position of the mold (100) at time tj after flipping, using this parameter.
[0066] Finally, it is important to note that... Figure 12a Tables in 'b' and 'c' contain undefined cells represented in gray or black. These groups of cells are actually related to the so-called "impossible combination" problem, due to some obvious structural factors, namely: - The dice (100) at the instant after being flipped t j The side that comes into contact with the game scene (S) obviously cannot be the same as the moment t before the flip. j The side that contacts the game scene (S) is exactly the same, namely Fs i ≠ Fs j ; - As mentioned before, from surface Fs i The faces that can be reached after the initial flip are not all N faces of the die (100), but only a subset of them; this subset consists of the faces Fs. i Defined by Z faces that are adjacent to and therefore share an edge with it. As mentioned earlier, Z ∈ {3, 4}, specifically depending on the triangle or square shape factor that can characterize the die (100) according to the proposed patent.
[0067] Refer to the attached diagram, especially Figure 13 , 14 Sections 15 and 16 illustrate several possible applications of the tracking system described in the proposed patent. More specifically, four embodiments are provided for dice with N=4 (150), N=6 (130), N=8 (160), and N=20 (170) faces. Furthermore, Figure 13 , 14Figures 15 and 16 visually depict the Z possible flips of each die on adjacent faces starting from the stationary face Fsi at the moment ti before the flip. As shown in the figure, the Z value ∈ {3, 4} depends on the shape of each face of the die (100), namely triangle (150), (160), (170) or square (130).
[0068] Refer to the attached diagram, especially Figure 17 and Figure 18 This paper presents two practical examples (200) and (250) illustrating how to construct a grid (G) based on different types of dice—that is, based on the number of faces N of the dice and its characteristics (such as the triangular or square shape factor of the faces).
[0069] Specifically, grid (200) is used to map chips (110), (120), and (130) with square face shape factors, while grid (250) is used to map chips (150), (160), and (170) with triangular face shape factors. Grids (200) and (250) have cells of either square (201) or triangular (251) shape, depending on the face shape factor of the chip being tracked.
[0070] Finally, refer to the attached diagram, especially... Figure 19 The method of using the tracking system proposed in this invention is described in algorithmic form; the method includes the following steps: a) At time t0, the device (300) acquires the initial configuration of the die (100), which includes the identification of the die type, i.e., the number of faces (dN), and the initial orientation of each face relative to the reference frame (XY) and the initial position of the die (100) on the game scene (S): - dN - [F1, …, Fs0, Fx 0, …, F N ] to - (X0,Y0)∈S b) At time t i The configuration of the die (100) is initialized before the flip; the initialization includes the following assignments: - t i =t0 - Fx i = Fx0; - Fs i = Fs0; - (X i Y i ) ti = (X0, Y0) t0 c) For the time interval [t] i , t j Each transition where the dice (100) flips occurs within the game scene (S), obtain the new face Fs that remains on the game scene (S) after the dice (100) flips. j And according to the following formula Fx j = TN(Fs i Fx i , Fs j Determine the new value of the dwelling surface Fx in the table TN(dN); d) Verify the value Fx determined in table TN(dN). j Check if it's valid; if not, report an error. e) If Fx j If the value is valid, then the deviation (Dxy) is determined in table VN(dN). j ) = VN (Fs i Fx i ,Fs j ), and determine the new position of the die (100) on the grid (G) according to the following formula: (X j Y j ) tj = (X i ,Y i ) ti + (Dxy j ); f) Update the configuration and storage location of the mold surface based on the new configuration and position after flipping: [F1, …, Fs, Fx , …, F N ] = [F1, …, Fs j Fx j , …, F N ] tj (X,Y) = (X j ,Y j ) tj g) Initialize the values of Fs, Fx, and (X, Y) for the next transformation: - Fx i = Fx j ; - Fs i = Fs j ; - (X i Y i ) ti= (X j Y j ) tj Industrial applications This invention has multiple application prospects in the gaming industry because it can transform traditional board games into so-called "hybrid board games." In particular, the system can achieve dice trajectory tracking without the need for complex and expensive sensor-equipped boards, and can be easily applied to various game scenarios and traditional boards, thus minimizing the impact on the structure while maintaining relative simplicity and ease of use. From a structural design perspective, the proposed tracking system can be further adapted using technical equivalents, employing supplementary materials or devices suitable for its purpose and application scope. The structure and dimensions of each component can be adjusted appropriately and consistently while adhering to the proposed solution. As a non-limiting example, it should be noted that the geometry of the relevant components can be adjusted while maintaining the aforementioned functionality. For example, at the hardware level, the number and type of sensors mounted on the circuit board (1000) can be changed, including any other type of sensor used to detect the spatial orientation of the chip itself. Therefore, in addition to the aforementioned accelerometer, other or additional sensors, such as gyroscopes, inertial sensors, etc., can be used. Furthermore, the techniques used for wireless data transmission between the chip and the receiving electronic device, particularly the type of protocol employed, can be modified, but without exceeding the characteristics and functional scope specific to the system described below and claimed. Changing these implementations will require adjustments to the signal processing, acquisition, and communication circuitry between components, without deviating from the purpose and application scope of the proposed solution. Finally, the invention can also be partially implemented.
Claims
1. A board game tracking system, characterized in that: comprising a board depicting a game scene (S) provided with a reference frame (XY); the system being able to track the position and orientation of a die (100) having N faces [F1,..., Fs, Fx,..., F N ] with N ∈ {4, 6, 8, 20}, where Fs is a face in contact with the scene (S) and Fx is a face oriented towards the reference frame (XY); the die (100) being moved by being flipped on the scene (S) along an edge between the face Fs and one of the adjacent Z faces, with Z ∈ {3, 4}; the die (100) being moved along a trajectory (T) starting from an initial position (X0, Y0) t0 ∈ (S) and faces [F1,..., Fs0, Fx0,..., F N ] t0 ; the board game tracking system being able to determine, for each flip of the die (100) in a time interval [t i , t j ] with initial position (X i , Y i ) ti and initial configuration of faces [F1,..., Fs i , Fx i ,..., F N ] ti : Face [F1, …, Fs] j Fx j , …, F N ] tj New configuration and New location (X) j Y j ) tj The aforementioned board game tracking system includes: An electronic circuit board (1000) integrated in the die (100); the electronic circuit board (1000) is used in the time interval [t] i , t j Within the game scene (S), the two faces Fs of the dice (100) placed on the game scene (S) are remotely detected and transmitted. i 、Fs j ; An external electronic device (300) is equipped with a memory (M) on which the positions (X) for storing and updating the dice (100) are mounted. j Y j ) tj and its faces [F1, …, Fs] j Fx j , …, F N ]t j The newly configured device; the device includes two lookup tables: TN(dN), which is specific to Fs i Fx i and Fs j For each possible combination, determine the new value Fx according to the recursive function. j : Fx j = TN (Fs i , Fx i , Fs j ); VN(dN), which is relative to Fs i Fx i and Fs j For each possible combination, the new position (X) is determined according to the recursive function. j ,Y j ) tj : (X j ,Y j ) tj = (X i ,Y i ) ti + (Dxy j ), where (Dxy j )= VN (Fs i , Fx i , Fs j ); A mesh (G) superimposed on the game scene (S); the mesh (G) is formed by starting from an initial position (X0, Y0). t0 Starting from S, the shape of the side (Fs) of the die (100) is copied along the axis of the reference frame (XY).
2. The board game tracking system according to claim 1, wherein the electronic board (1000) comprises: - An orientation sensor (1001); - One processing unit (1002); - One battery (1004). - A memory (1003) containing a lookup table that maps the detection results of the sensor (1001) to the orientation of the faces of the die (100); - A remote communication system (1005).
3. The board game tracking system according to claims 1 and 2, wherein the orientation sensor (1000) comprises at least one electronic component selected from the following categories: gyroscope, accelerometer, inertial switch, capacitive sensor or positioning device.
4. The board game tracking system according to claims 1 and 2, wherein the processing unit (1002) is selected from a CPU, a microcontroller, or a PIC.
5. The board game tracking system according to claim 1, wherein the lookup table TN(dN) comprises N×Z rows and N columns; the lookup table TN(dN) is indexed by rows, and its indexing rules are as follows: Fs i ; Fx i ; The lookup table TN(dN) is indexed by column as follows: Fs j。 6. The board game tracking system according to claim 1, wherein the lookup table VN(dN) comprises N rows and dN columns; the lookup table VN(dN) is indexed by rows, and its indexing rules are as follows: Fs i ; Fx i ; The lookup table VN(dN) is indexed by column in the following manner: Fs j。 7. The board game tracking system according to claim 1, wherein, When N=6, the grid (G) consists of square cells (201).
8. The board game tracking system according to claim 1, wherein, When N ∈ {4,8,20}, the grid (G) consists of a triangular grid (251).
9. The board game tracking system according to claim 1, wherein the grid (G) is obtained by: Graphic decorations on the game scene (S); A graphics layer that can be overlaid on the game scene (S); Direct or indirect light rays projected onto the game scene (S); By extruding grooves or cuts into the game scene (S); Reliefs are created using dividers, stackable magnetic elements, and metal wires.
10. A method for tracking the position and orientation of a die (100) having N faces using a board game tracking system as described in any one of claims 1 to 8, the method comprising the following steps: Obtain the initial configuration of the mold (100), the configuration including: The number N that is rolled on a 100 die; The initial position of the die (100) is (X0, Y0). t0 ∈ (S); Initial configuration of the die (100) roll face [F1, …, Fs0, Fx0, …, F N ] t0 ; Initialization of memory allocation (M); the initialization includes the following assignment operations: t i =t 0; Fx i = Fx0; Fs i = Fs0; (X i ,Y i ) ti = (X0,Y0) t0 . Obtain the surface Fs transferred by the mold (100) j And identify the value Fx in the table TN(dN). j ; Verify value Fx j The validity of the result; if it is negative, report an error and return to step c); The new position of the die (100) on the grid (G) is determined by the following formula: (X j Y j )t j = (X i ,Y i ) ti + (Dxy j ); where (Dxy j ) = VN (Fsi, Fxi, Fsj) represents two consecutive positions (X... i ,Y i ) ti With (X) j ,Y j ) tj Deviation between; Update the tracking information of chip (100) in memory (M) according to the following assignments: [F1, …, Fs, F i , …, F N ] = [F1, …, Fs j , Fx j , …, F N ] tj (X,Y) = (X j ,AND j ) tj Initialize the values of Fs, Fx, and (X, Y) in memory M for subsequent conversions by chip (100): Fx i = Fx j ; Fs i = Fs j ; (X i , AND i ) ti = (X j ,AND j ) tj。
Citation Information
Patent Citations
Modular electronic dice system
US20220274009A1
