****
Aqui: espacenet
As quatro patentes:
GB2454535: Download
GB2454536: Download
GB2454537: Download
GB2454538: Download
Ver ainda:
Intellectual Property Office: 9 (as duas últimas entradas) 10 (as duas primeiras entradas)
As quatro patentes:
GB2454535: Download
GB2454536: Download
GB2454537: Download
GB2454538: Download
Ver ainda:
Intellectual Property Office: 9 (as duas últimas entradas) 10 (as duas primeiras entradas)
***
Excertos dos textos das patentes:
«As means of introducing the key aspects covered by this invention consider Microsoft Corporation’s computer-based puzzle game Tetravex and the mathematical work of Jorge Rezende, University of Lisbon.
(...)
The mathematical work of Jorge Rezende has been published in the papers entitled “On the Puzzles with Polyhedra and Numbers” and “Puzzles with Polyhedra and Permutation Groups”, available via the web site of the Mathematical Group of the University of Lisbon (http://gfm.cii.fc.ul.pt/people/jrezende/pt/?set_language=pt). The publications cover the mathematical methods behind using polygonal plates (tiles), with numerical indicia ascríbed to each edge, to form the surface of regular polyhedron. Although the analysis is very detailed and covers a method (effectively a search based routine) that determines how many solutions a particular indicia set can produce, i.e. how many different ways the tiles can be arranged to form the surface of the polyhedron by matching adjacent indicia of different tiles, there is no discussion on limiting the allocation of the indicia to ensure an unique solution.»
(...)
The mathematical work of Jorge Rezende has been published in the papers entitled “On the Puzzles with Polyhedra and Numbers” and “Puzzles with Polyhedra and Permutation Groups”, available via the web site of the Mathematical Group of the University of Lisbon (http://gfm.cii.fc.ul.pt/people/jrezende/pt/?set_language=pt). The publications cover the mathematical methods behind using polygonal plates (tiles), with numerical indicia ascríbed to each edge, to form the surface of regular polyhedron. Although the analysis is very detailed and covers a method (effectively a search based routine) that determines how many solutions a particular indicia set can produce, i.e. how many different ways the tiles can be arranged to form the surface of the polyhedron by matching adjacent indicia of different tiles, there is no discussion on limiting the allocation of the indicia to ensure an unique solution.»
No comments:
Post a Comment