806 resultados para Game-Playing Game-Playing
Resumo:
Relatos Verídicos de Luciano de Samósata es una oportunidad para ver en acción a un escritor desobediente. Manifestar explícitamente su mentira para evidenciar, con sarcasmo y mucho de ironía, la actividad malintencionada de aquellos autores que engañan a su auditorio fue una decisión ética enmascarada con humor. Por esta razón, sostenemos que el samosatense promovió un acuerdo que llegaría intacto hasta nuestros días: Luciano inauguró el pacto ficcional con su lector. Mediante sus palabras, en el juego de espejos que propone el lenguaje, trazo una directriz de su conducta ética como escritor, decidió exponer su mentira para convertirla en verdad contribuyendo a la consolidación del nuevo terreno, la ficción. El auténtico camino de Luciano no condujo a la luna sino al deslinde entre la mentira y la ficción. Emprender aquella travesía escrituraria le permitió implantar un fundamento ético de sinceridad que, paradójicamente, postula el estadio perpetuo de lo verosímil
Resumo:
Relatos Verídicos de Luciano de Samósata es una oportunidad para ver en acción a un escritor desobediente. Manifestar explícitamente su mentira para evidenciar, con sarcasmo y mucho de ironía, la actividad malintencionada de aquellos autores que engañan a su auditorio fue una decisión ética enmascarada con humor. Por esta razón, sostenemos que el samosatense promovió un acuerdo que llegaría intacto hasta nuestros días: Luciano inauguró el pacto ficcional con su lector. Mediante sus palabras, en el juego de espejos que propone el lenguaje, trazo una directriz de su conducta ética como escritor, decidió exponer su mentira para convertirla en verdad contribuyendo a la consolidación del nuevo terreno, la ficción. El auténtico camino de Luciano no condujo a la luna sino al deslinde entre la mentira y la ficción. Emprender aquella travesía escrituraria le permitió implantar un fundamento ético de sinceridad que, paradójicamente, postula el estadio perpetuo de lo verosímil
Resumo:
Durante la formación inicial, los estudiantes del profesorado de Educación Física construyen conocimientos teóricos y prácticos alrededor de prácticas corporales ya conocidas y vivenciadas. Aprenden sobre lo aprendido. Redefinen conocimientos prácticos en un nivel mayor de complejidad y abstracción asignándoles valor educativo que fundamentará su intervención profesional. Cuando le enseñan a proponer 'juegos no juegos' (actividades o deportes que presenta como juegos aunque no todos pueden jugar) el estudiante de Educación Física dispone de elementos teóricos que fundamentan el uso del juego como un recurso pedagógico (ya sea, como contenido de otros ejes, o como estrategia metodológica para la enseñanza de deportes o habilidades motoras). Sin embargo, cuando le enseñan a proponer juegos populares para divertirse, encuentra dificultad para planificar y justificar su futura intervención. Los resultados finales de una investigación cualitativa, presentada como tesis de maestría, muestran que en Educación Física se enseñan múltiples formas de juego motor con otros pero un solo modo de jugarlos: el no lúdico. Se enseña a subordinar el modo de jugar a la forma de los juegos propuestos por el profesor. Se enseña a moverse en el marco de lo permitido por las reglas del juego, a poner el cuerpo al servicio del juego
Resumo:
Los actuales Diseños Curriculares para el Nivel Inicial y la Educación Primaria (Primer Ciclo) del Gobierno de la Provincia de Buenos Aires 2008, han mostrado en el área de Educación Física un gran interés por reivindicar y exigir la enseñanza del juego. En su lectura se puede apreciar que al profesor del área se le requiere que 'enriquezca', 'amplie', 'complejice', 'multiplique', y principalmente 'promueva' las experiencias de juego, por lo que posicionaría al profesor como 'mediador' quien 'dispondría' los recursos para el 'normal desarrollo' de ese jugar que porta cada niño/a.
A Mathematical Representation of "Excitement" in Games: A Contribution to the Theory of Game Systems
Resumo:
Researchers have long believed the concept of "excitement" in games to be subjective and difficult to measure. This paper presents the development of a mathematically computable index that measures the concept from the viewpoint of an audience and from that of a player. One of the key aspects of the index is the differential of the probability of "winning" before and after one specific "play" in a given game. The index makes a large contribution to the study of games and enables researchers to compare and analyze the “excitement” of various games. It may be applied in many fields, especially the area of welfare economics, and applications may range from those related to allocative efficiency to axioms of justice and equity.
Resumo:
Recently, steady economic growth rates have been kept in Poland and Hungary. Money supplies are growing rather rapidly in these economies. In large, exchange rates have trends of depreciation. Then, exports and prices show the steady growth rates. It can be thought that per capita GDPs are in the same level and development stages are similar in these two countries. It is assumed that these two economies have the same export market and export goods are competing in it. If one country has an expansion of monetary policy, price increase and interest rate decrease. Then, exchange rate decrease. Exports and GDP will increase through this phenomenon. At the same time, this expanded monetary policy affects another country through the trade. This mutual relationship between two countries can be expressed by the Nash-equilibrium in the Game theory. In this paper, macro-econometric models of Polish and Hungarian economies are built and the Nash- equilibrium is introduced into them.
Resumo:
This report addresses speculative parallelism (the assignment of spare processing resources to tasks which are not known to be strictly required for the successful completion of a computation) at the user and application level. At this level, the execution of a program is seen as a (dynamic) tree —a graph, in general. A solution for a problem is a traversal of this graph from the initial state to a node known to be the answer. Speculative parallelism then represents the assignment of resources to múltiple branches of this graph even if they are not positively known to be on the path to a solution. In highly non-deterministic programs the branching factor can be very high and a naive assignment will very soon use up all the resources. This report presents work assignment strategies other than the usual depth-first and breadth-first. Instead, best-first strategies are used. Since their definition is application-dependent, the application language contains primitives that allow the user (or application programmer) to a) indícate when intelligent OR-parallelism should be used; b) provide the functions that define "best," and c) indícate when to use them. An abstract architecture enables those primitives to perform the search in a "speculative" way, using several processors, synchronizing them, killing the siblings of the path leading to the answer, etc. The user is freed from worrying about these interactions. Several search strategies are proposed and their implementation issues are addressed. "Armageddon," a global pruning method, is introduced, together with both a software and a hardware implementation for it. The concepts exposed are applicable to áreas of Artificial Intelligence such as extensive expert systems, planning, game playing, and in general to large search problems. The proposed strategies, although showing promise, have not been evaluated by simulation or experimentation.
Resumo:
Abstract This work is focused on the problem of performing multi‐robot patrolling for infrastructure security applications in order to protect a known environment at critical facilities. Thus, given a set of robots and a set of points of interest, the patrolling task consists of constantly visiting these points at irregular time intervals for security purposes. Current existing solutions for these types of applications are predictable and inflexible. Moreover, most of the previous centralized and deterministic solutions and only few efforts have been made to integrate dynamic methods. Therefore, the development of new dynamic and decentralized collaborative approaches in order to solve the aforementioned problem by implementing learning models from Game Theory. The model selected in this work that includes belief‐based and reinforcement models as special cases is called Experience‐Weighted Attraction. The problem has been defined using concepts of Graph Theory to represent the environment in order to work with such Game Theory techniques. Finally, the proposed methods have been evaluated experimentally by using a patrolling simulator. The results obtained have been compared with previous available
Resumo:
A novel algorithm based on bimatrix game theory has been developed to improve the accuracy and reliability of a speaker diarization system. This algorithm fuses the output data of two open-source speaker diarization programs, LIUM and SHoUT, taking advantage of the best properties of each one. The performance of this new system has been tested by means of audio streams from several movies. From preliminary results on fragments of five movies, improvements of 63% in false alarms and missed speech mistakes have been achieved with respect to LIUM and SHoUT systems working alone. Moreover, we also improve in a 20% the number of recognized speakers, getting close to the real number of speakers in the audio stream
Resumo:
In this article we present a didactic experience developed by the GIE (Group of Educational Innovation) “Pensamiento Matemático” of the Polytechnics University of Madrid (UPM), in order to bring secondary students and university students closer to Mathematics. It deals with the development of a virtual board game called Mate-trivial. The mechanics of the game is to win points by going around the board which consists of four types of squares identified by colours: “Statistics and Probability”, “Calculus and Analysis”, “Algebra and Geometry” and “Arithmetic and Number Theory ”. When landing on a square, a question of its category is set out: a correct answer wins 200 points, if wrong it loses 100 points, and not answering causes no effect on the points, but all the same, two minutes out of the 20 minutes that each game lasts are lost. For the game to be over it is necessary, before those 20 minutes run out, to reach the central square and succeed in the final task: four chained questions, one of each type, which must be all answered correctly. It is possible to choose between two levels to play: Level 1, for pre-university students and Level 2 for university students. A prototype of the game is available at the website “Aula de Pensamiento Matemático” developed by the GIE: http://innovacioneducativa.upm.es/pensamientomatematico/. This activity lies within a set of didactic actions which the GIE is developing in the framework of the project “Collaborative Strategies between University and Secondary School Education for the teaching and learning of Mathematics: An Application to solve problems while playing”, a transversal project financed by the UPM.
Resumo:
Con este proyecto se ha desarrollado una guía introductoria a uno de los aspectos más complejos y especializados de Blender, que es el control de su motor de videojuegos mediante programas escritos en Python. Está orientado a lectores que tienen un conocimiento amplio sobre el manejo de Blender, su interfaz y el funcionamiento de sus diferentes elementos, así como una mínima experiencia en cuanto a programación. Se ha organizado en una parte descriptiva, centrada en el lenguaje Python y en las bases de su uso para programar el motor de videojuegos (Game Engine) de Blender, y otra de práctica guiada, que constituye la mayoría del proyecto, donde se estudian de manera progresiva ejemplos concretos de uso del mismo. En la parte descriptiva se ha tratado tanto el funcionamiento más básico del lenguaje Python, especialmente las características que difieren de otros lenguajes de programación tradicionales, como su relación con Blender en particular, explicando las diferentes partes de la API de Blender para Python, y las posibles estrategias de uso. La parte práctica guiada, dado que esta interacción entre Blender y Python ofrece un rango de posibilidades muy amplio, se ha centrado en tres áreas concretas que han sido investigadas en profundidad: el control del objeto protagonista, de la cámara y la implementación de un mapa de orientación. Todas ellas se han centrado en torno a un ejemplo común, que consiste en un videojuego muy básico, y que, gracias a los ficheros de Blender que acompañan a esta memoria, sirve para apoyar las explicaciones y poder probar su efecto directamente. Por una parte, estos tres aspectos prácticos se han explicado exhaustivamente, y se han llevado hasta un nivel relativamente alto. Asimismo se han intentado minimizar las dependencias, tanto entre ellos como con la escena que se ha usado como ejemplo, de manera que sea sencillo usar los programas generados en otras aplicaciones. Por otra, la mayoría de los problemas que ha sido necesario resolver durante el desarrollo no son específicos de ninguna de las tres áreas, sino que son de carácter general, por lo que sus explicaciones podrán usarse al afrontar otras situaciones. ABSTRACT. This Thesis consists of an introductory guide to one of the most complex and specific parts of Blender, which is the control of its game engine by means of programs coded in Python. The dissertation is orientated towards readers who have a good knowledge of Blender, its interface and how its different systems work, as well as basic programming skills. The document is composed of two main sections, the first one containing a description of Python’s basics and its usage within Blender, and the second consisting of three practical examples of interaction between them, guided and explained step by step. On the first section, the fundamentals of Python have been covered in the first place, focusing on the characteristics that distinguish it from other programming languages. Then, Blender’s API for Python has also been introduced, explaining its different parts and the ways it can be used in. Since the interaction between Blender and Python offers a wide range of possibilities, the practical section has been centered on three particular areas. Each one of the following sections has been deeply covered: how to control the main character object, how to control the camera, and how to implement and control a mini-map. Furthermore, a demonstrative videogame has been generated for the reader to be able to directly test the effect of what is explained in each section. On the one hand, these three practical topics have been thoroughly explained, starting from the basis and gradually taking them to a relatively advanced level. The dependences among them, or between them and the demonstrative videogame, have been minimised so that the scripts or ideas can be easily used within other applications. On the other hand, most of the problems that have been addressed are not exclusively related to these areas, but will most likely appear in different situations, thus enlarging the field in which this Thesis can be used.
Resumo:
Creo que uno de los misterios más extraños que existen en nuestro país es el de las posibles causas por las que una especie de maleficio ha ido marcando el camino de la Microelectrónica. Pocos sectores de la tecnología han recibido un apoyo más constante y desde más entornos que ella y, al mismo tiempo, en pocos también se han obtenido menos frutos
Resumo:
We present initial research regarding a system capable of generating novel card games. We furthermore propose a method for com- putationally analysing existing games of the same genre. Ultimately, we present a formalisation of card game rules, and a context-free grammar G cardgame capable of expressing the rules of a large variety of card games. Example derivations are given for the poker variant Texashold?em , Blackjack and UNO. Stochastic simulations are used both to verify the implementation of these well-known games, and to evaluate the results of new game rules derived from the grammar. In future work, this grammar will be used to evolve completely novel card games using a grammar- guided genetic program.
Resumo:
In the area of the professional competition, the coach is a fundamental part in the management of a team and more concretely in the game planning. During the competition, the management of the times of pause and times out as well as the conduct of the coach during the same ones is an aspect to analyze in the sports performance. It is for this that it becomes necessary to know some of the behaviors that turn out to be more frequent by the coach and that are more related to a positive performance of his players. For it there has been realized a study of 7 cases of expert coaches in those that his verbal behavior has observed during 4 games. It has focused on the content of the information only to verbal level, on his meaning. The information that have been obtained in the study shows a major quantity of information elaborated during the pauses of the games and a major tactical content with regard to the moments of game. On the other hand, a relation exists between a major number of questions and a minor number of psychological instructions when the score is adverse, whereas in case of victory, a direct relation does not exist with any category. The rest of categories of the speech do not meet influenced directly for the result, for what it is not possible to consider a direct and immediate relation between the coach verbal behavior during the pauses and the result of the game, except in punctual moments.