If you intend to install ANY-maze on computers which you won't be using for tracking (and we actively encourage you to do so) then their requirements are even less exacting than those of the tracking computer. This can be a great benefit, allowing you and your co-workers to use ANY-maze to analyse results or transfer data to other programs without having to use the tracking computer. As you probably know, you can install ANY-maze (for free) on any number of different computers within your organisation, not just on the one you'll use for tracking. However, if you're planning to use a computer you already own, you should check it against the specifications given below. 7ĪNY-maze doesn't demand a very high specification computer (unless you plan to track in multiple apparatus at the same time), but nevertheless, you should still check that the computer you plan to use meets the specifications given here.Ĭhoosing the right specification computer for ANY-maze is relatively simple, indeed, almost any new computer will be suitable unless you plan to track in multiple apparatus simultaneously. 4 3.4 Minimum specification to run ANY-maze. 4 3.3 Minimum recommended specification for a computer to be used for tracking. 3 3.2 Recommended specification for a computer to be used for tracking with multiple apparatus. 3 3.1 Recommended specification for a computer to be used for tracking. Recommended and minimum specifications at a glance. While (!(tect(AgentDetection.Redstone, DOWN))) else if (!(tect(AgentDetection.ANY-maze Choosing a computer for ANY-maze 1 In the ||agent:agent detect|| block, use the drop-down menu to select down as the direction. In the ||agent:agent detect|| block, use the drop-down menu to select redstone as the type of block to detect. You’ll put the whole algorithm in a ||loops:while|| loop, which will tell your agent to continue searching for the end of the maze as long as it isn’t standing on redstone.įrom ||loops:LOOPS||, drag a ||loops:while|| loop into ||player:on chat command "mr"||.įrom ||logic:LOGIC||, put a ||logic:not|| block into the ||loops:while|| loop replacing the true.įrom ||agent:AGENT||, drag an ||agent:agent detect|| into the ||logic:not||. Create an ||player:on chat command|| block and rename it to "mr" which stands for maze runner.Then you will need to turn the agent left(“lt”) or right(“rt”) to get it facing inwards. Type the command “tp” into the chat window. Move your player to the start of the maze.Let’s use the basic agent controls to move the agent to the starting point of the maze.
#Any maze how to code#
You can copy the preceding code by highlighting the code, pressing Ctrl+C to copy, and then pasting (Ctrl+V) the code into the JavaScript side in your code connection.
This code allows you to easily position the agent.
Use this starter code from the Introduction to the Agent activity. Make a new projectĬreate a new MakeCode project called “Pathfinder”. If the agent gets stuck, go ahead and use the steps to complete the program. Try to code a way for the agent to get to the ending point on your own without following the activity steps. Otherwise, if there is no block to the right of you, Otherwise, if there is no block in front of you, So, our simple maze-following algorithm looks like: As long as you aren't standing on redstone:
In a Minecraft maze, this basically means always turn left whenever you can, and when you reach a dead end, turn around. You may not find the most direct way out, but you will always come out on the other side. In any maze or labyrinth, you can always find your way out by following one wall consistently. The agent will detect this redstone under its feet to signal the end of the code. This is how your code will know when the agent has finished the maze. The activity asks you to place a redstone at the end of the maze. In case you missed this, the code from the previous activity, Maze Generation, builds a maze for you.
#Any maze how to how to#
Rather than giving the agent a set series of directional commands to solve one particular maze, you are going to need to use conditional statements to teach the agent how to find its way through any maze, intelligently. Now let’s teach the agent how to navigate a maze on its own.
0 kommentar(er)
