Bespoke controllers and their impact on game feel

This project explores the role and effect of bespoke game controllers on game feel and accessibility. The project aims to develop a range of custom controllers and associated games, designed to tightly couple the user interaction with the game execution. Player analytics will be collected to quantify, explore and improve the user experience.Game feel encompasses a wide range of definitions including intuitive controls, physical interaction with virtual objects, and the appeal of playing. Game feel is subjective and therefore challenging to quantify, but something every player instinctively recognises. There is a growing niche of games utilising bespoke hardware to deliver a unique player experience, such as games played with Unicorn horns or by shouting, rather than the traditional controller. The project seeks to push the boundaries of games and explore how game design, user experience and accessibility are affected when the limitation of traditional input systems is removed. The project has developed four bespoke controllers, utilising creative technologies and physical sensors. The controllers are based on inputs using force sensitive sensors, flex sensors, distance sensor and orientation sensors. Prototype games have been developed for each controller designed to exploit the controllers unique form of user interaction. The next steps are to evaluate the player experience and explore how the various controllers are utilised using a data-driven approach.The project proposes that the bespoke controller could widen engagement and improve the user experience by delivering a more intuitive interface and improving game feel. The project will provide insights and design guidelines for both of the development of the custom game controllers and how they can be linked to certain game mechanics in the associated games

K-6 minors in large 6-connected graphs

Jorgensen conjectured that every 6-connected graph with no K-6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs. (C) 2017 Published by Elsevier Inc

Excluded minors in cubic graphs

Let G be a cubic graph, with girth at least five, such that for every partition X,Y of its vertex set with |X|,|Y|>6 there are at least six edges between X and Y. We prove that if there is no homeomorphic embedding of the Petersen graph in G, and G is not one particular 20-vertex graph, then either G\v is planar for some vertex v, or G can be drawn with crossings in the plane, but with only two crossings, both on the infinite region. We also prove several other theorems of the same kind.Comment: 62 pages, 17 figure