A Progressive Approach to Content Generation

Abstract. PCG approaches are commonly categorised as constructive, generate-and-test or search-based. Each of these approaches has its distinctive advantages and drawbacks. In this paper, we propose an approach to Content Generation (CG) – in particular level generation – that combines the advantages of construc-tive and search-based approaches thus providing a fast, flexible and reliable way of generating diverse content of high quality. In our framework, CG is seen from a new perspective which differentiates between two main aspects of the game-play experience, namely the order of the in-game interactions and the associated level design. The framework first generates timelines following the search-based paradigm. Timelines are game-independent and they reflect the rhythmic feel of the levels. A progressive, constructive-based approach is then implemented to evaluate timelines by mapping them into level designs. The framework is applied for the generation of puzzles for the Cut the Rope game and the results in terms of performance, expressivity and controllability are characterised and discussed.

Automated Problem Decomposition for the Boolean Domain with Genetic Programming

Researchers have been interested in exploring the regularities and modularity of the problem space in genetic programming (GP) with the aim of decomposing the original problem into several smaller subproblems. The main motivation is to allow GP to deal with more complex problems. Most previous works on modularity in GP emphasise the structure of modules used to encapsulate code and/or promote code reuse, instead of in the decomposition of the original problem. In this paper we propose a problem decomposition strategy that allows the use of a GP search to find solutions for subproblems and combine the individual solutions into the complete solution to the problem

Microwave oven fabricated hybrid memristor devices for non-volatile memory storage

© 2014 IOP Publishing Ltd. Novel hybrid non-volatile memories made using an ultra-fast microwave heating method are reported for the first time. The devices, consisting of aligned ZnO nanorods embedded in poly (methyl methacrylate), require no forming step and exhibit reliable and reproducible bipolar resistive switching at low voltages and with low power usage. We attribute these properties to a combination of the high aspect ratio of the nanorods and the polymeric hybrid structure of the device. The extremely easy, fast and low-cost solution based method of fabrication makes possible the simple and quick production of cheap memory cells

The random phase approximation applied to ice

Standard density functionals without van der Waals interactions yield an unsatisfactory description of ice phases, specifically, high density phases occurring under pressure are too unstable compared to the common low density phase I$_h$ observed at ambient conditions. Although the description is improved by using functionals that include van der Waals interactions, the errors in relative volumes remain sizable. Here we assess the random phase approximation (RPA) for the correlation energy and compare our results to experimental data as well as diffusion Monte Carlo data for ice. The RPA yields a very balanced description for all considered phases, approaching the accuracy of diffusion Monte Carlo in relative energies and volumes. This opens a route towards a concise description of molecular water phases on surfaces and in cavities

Distributional fixed point equations for island nucleation in one dimension: a retrospective approach for capture zone scaling

The distributions of inter-island gaps and captures zones for islands nucleated on a one-dimensional substrate during submonolayer deposition are considered using a novel retrospective view. This provides an alternative perspective on why scaling occurs in this continuously evolving system. Distributional fixed point equations for the gaps are derived both with and without a mean field approximation for nearest neighbour gap size correlation. Solutions to the equations show that correct consideration of fragmentation bias justifies the mean field approach which can be extended to provide closed-from equations for the capture zones. Our results compare favourably to Monte Carlo data for both point and extended islands using a range of critical island size $i=0,1,2,3$. We also find satisfactory agreement with theoretical models based on more traditional fragmentation theory approaches.Comment: 9 pages, 7 figures and 1 tabl

A note on the computation of geometrically defined relative velocities

We discuss some aspects about the computation of kinematic, spectroscopic, Fermi and astrometric relative velocities that are geometrically defined in general relativity. Mainly, we state that kinematic and spectroscopic relative velocities only depend on the 4-velocities of the observer and the test particle, unlike Fermi and astrometric relative velocities, that also depend on the acceleration of the observer and the corresponding relative position of the test particle, but only at the event of observation and not around it, as it would be deduced, in principle, from the definition of these velocities. Finally, we propose an open problem in general relativity that consists on finding intrinsic expressions for Fermi and astrometric relative velocities avoiding terms that involve the evolution of the relative position of the test particle. For this purpose, the proofs given in this paper can serve as inspiration.Comment: 8 pages, 2 figure

Integration of the Friedmann equation for universes of arbitrary complexity

An explicit and complete set of constants of the motion are constructed algorithmically for Friedmann-Lema\^{i}tre-Robertson-Walker (FLRW) models consisting of an arbitrary number of non-interacting species. The inheritance of constants of the motion from simpler models as more species are added is stressed. It is then argued that all FLRW models admit what amounts to a unique candidate for a gravitational epoch function (a dimensionless scalar invariant derivable from the Riemann tensor without differentiation which is monotone throughout the evolution of the universe). The same relations that lead to the construction of constants of the motion allow an explicit evaluation of this function. In the simplest of all models, the $\Lambda$CDM model, it is shown that the epoch function exists for all models with $\Lambda > 0$, but for almost no models with $\Lambda \leq 0$.Comment: Final form to appear in Physical Review D1

Painleve-Gullstrand Coordinates for the Kerr Solution

We construct a coordinate system for the Kerr solution, based on the zero angular momentum observers dropped from infinity, which generalizes the Painleve-Gullstrand coordinate system for the Schwarzschild solution. The Kerr metric can then be interpreted as describing space flowing on a (curved) Riemannian 3-manifold. The stationary limit arises as the set of points on this manifold where the speed of the flow equals the speed of light, and the horizons as the set of points where the radial speed equals the speed of light. A deeper analysis of what is meant by the flow of space reveals that the acceleration of free-falling objects is generally not in the direction of this flow. Finally, we compare the new coordinate system with the closely related Doran coordinate system.Comment: 6 pages; v2: new section, matches final published version; v3: sign error in the expression of the function delta correcte

Program trace optimization

This is the author accepted manuscript. The final version is available from Springer via the DOI in this record.Paper to be presented at the Fifteenth International Conference on Parallel Problem Solving from Nature (PPSN XV), Coimbra, Portugal on 8-12 September 2018.We introduce Program Trace Optimization (PTO), a system for `universal heuristic optimization made easy'. This is achieved by strictly separating the problem from the search algorithm. New problem definitions and new generic search algorithms can be added to PTO easily and independently, and any algorithm can be used on any problem. PTO automatically extracts knowledge from the problem specifi cation and designs search operators for the problem. The operators designed by PTO for standard representations coincide with existing ones, but PTO automatically designs operators for arbitrary representations