Revitalizing the second puzzle.

Following it's failure in the usability test, the second puzzle was reworked from the ground up.

For a start, the cubes that were to be moved around were made into a prefab, so they could be recreated in the game world easier. I also made the current texture of the cube change based on what variable the number of the box was set to, rather than assigning the textures manually. The textures it could choose from were themselves stored in a list, and modified in the Unity editor. This means in theory I could replace the numbers with just about anything (such as shapes) and could have a similar puzzle with a very different context.

I decided the optimum way of making the puzzle was to have a simple check against a value in a list, and to see whether or not it matched the current box number of the cube.
To make the puzzle easier to edit and rearrange, the list that the current layout of cubes was to check against was sorted at the beginning of the game with Quicksort, a divide and conquer algorithm.

Quicksort works by selecting a number as a pivot, and placing all numbers lower or equal to that number behind the pivot, and the rest greater than the pivot. This is done recursively. I chose the initial pivot point to be the middlemost number in the sequence, but this could also be done randomly.
Quicksort usually has a complexity of O(n log n), but at worst case its O(n²), depending on whether the number chosen is at the end of the sorted sequence. Still, since I am working with a small list, the impact on the program will be minimal. For this puzzle, the algorithm is only run once, rather than repeatedly like the original version of the puzzle.
Once the current numbers were sorted, this sorted list was stored in an invisible object and used to check against each individual cube as they were moved about. (Green means the cube is in the correct position, red means it isn't.)

Each cube has three states, the initial setup (-1),  wherein the cube finds out which position it is currently in, 0, in which case it is ready to connect to a lock point prefab, and 1, wherein the cube is connected and no further code should be run. If the cube is removed from the lock point, the state is set to 0


The new approach for this puzzle, a cube will only light up green if it is in the correct position, which should make the puzzle easier to figure out.

Comments

Post a Comment

Popular posts from this blog

102CR Portfolio

Image
102CR: Portfolio: UI Design: For this task I had to come up with a menu GUI for the ALL project I was developing. The interactive storyline was set in cyberspace, so I tried to give my piece a digital feel. Since the game had a very minimalist style, I tried to do the same with my menu. Final Piece: I started off by doing a very rough sketch of the idea I wanted to do. I used this simple sketch as the basis. I used a grid to help get exact line placement. The buttons were drawn flat first. I combined the font to be used onto the shapes. I used the 3D effect function on the menu, which made it more visually interesting, and helped match the visual style of the interactive story. I had to manually move every part of the menu to make it line up, as the 3D doesn’t work on the grid. A deliberately retro looking font, Adore64, was chosen for the title and the on screen text. This font was hard to read on the buttons once they were rendered in 3D, so a different font was c...
Read more

Puzzle 2 - First Attempt

Image
Puzzle 2 Algorithm A number sorting puzzle was created by myself that could be implemented into the final game. This uses Marco’s Gravity Gun code in order to move cubes around. This puzzle went through 2 iterations, and was changed based off user feedback and the fact the first version didn’t really work at all. Puzzle Type 1:     The puzzle is to make all the numbers on the cubes be in ascending order. The puzzle is built in the game world, and instantiates additional objects on startup which act as lock on points, so that the cubes will snap in place. In a actual game, these would probably be invisible and the puzzle built into a wall. The first algorithm used was Binary Search, the idea being that it would return true if the number in sequence was found. Here is the function for the binary search.   Binary searches only work on sorted arrays, so the theory was that it would check against the array and see if it sorted. There is an invisible object whic...
Read more

Early Game Puzzle - Finding the Terrorist

Image
One of the story portions involves the player finding a Terrorist who has performed a recent bombing. To do this I came up with a simple puzzle: Have the player look about at a map of the world and locate the Terrorist as they example the map. The idea is that whilst examining the map, a cross-hair will appear and as they get closer to the location of the terrorist, a sound will play (with increasing speed) and a faint glow will increase as they encroach. To do this we use Raycasting, which sends out a invisible line between the player and the world surrounding them. We use a Prefab to create the cross-hair object only when the Raycast hits a object on a specific layer. The code then compares the distance between the cross-hair prefab and an invisible object attached to the map. If its lower than a certain value, then it creates a second prefab, that of a glowing object. This prefab has its own script which increases the alpha of the colour rendered as it gets closer. ...
Read more