AmbifulWorksheets
Practice that never repeats
CBSE · Class 6 · Computational Thinking and AI

Grids and Movement

Standard difficulty · 20 questions · 40 marks · Time: 37 minutes

Name: Date: Score: ____ / 40

Show your working for Sections B and C. Answers are on the last page — try every question first!

Section A — Choose the correct answer8 × 1 = 8 marks
1.
A robot facing North turns right 90°. It now faces:
  1. South
  2. North
  3. West
  4. East
2.
A robot is on a 5 × 5 grid. Cells are named (column, row), with (1, 1) at the bottom left. It starts at (5, 1) facing North. F = move forward one cell, L = turn left 90°, R = turn right 90° (turning stays in the same cell). It follows: F L F L F. In which cell does it stop? Give (column, row).
  1. (4, 1)
  2. (5, 1)
  3. (1, 4)
  4. (4, 2)
3.
A robot is on a 5 × 5 grid. Cells are named (column, row), with (1, 1) at the bottom left. It starts at (5, 3) facing North. F = move forward one cell, L = turn left 90°, R = turn right 90° (turning stays in the same cell). It follows: F F L L F L R. Which way is it facing at the end?
  1. East
  2. North
  3. South
  4. West
4.
⬜ ⬜ ⬜ ⬜ ⭐
⬜ ⬜ ⬜ ⬜ ⬜
⬛ ⬜ ⬛ ⬛ ⬜
⬜ ⬛ ⬜ ⬜ ⬜
⬜ 🤖 ⬜ ⬜ ⬜
The robot 🤖 moves one square at a time up, down, left or right (not diagonally), and cannot enter a black square ⬛. What is the fewest number of moves to reach the star ⭐?
  1. 7
  2. 8
  3. 6
  4. 9
5.
On a street grid you walk from corner (0, 0) to corner (3, 5), moving only right (east) or up (north), one block at a time. How many different shortest routes are there?
  1. 57
  2. 56
  3. 15
  4. 8
6.
On a grid of streets, a delivery robot goes 8 steps East, then 6 steps West, then 8 steps South, then 7 steps West, then 5 steps North. It can only move North, South, East or West. What is the fewest number of steps to get back to the start?
  1. 10
  2. 34
  3. 8
  4. 2
7.
On a 6 × 6 grid with no walls, a robot moves one cell at a time across or up and down (never diagonally). What is the fewest number of moves from (6, 6) to (5, 3)?
  1. 5
  2. 3
  3. 4
  4. 6
8.
A robot on a 5 × 5 grid starts at (4, 2) facing East (cells are (column, row), (1, 1) at the bottom left). F = forward one cell, L and R = turn 90° left or right. Which commands take it to (4, 3)?
  1. R F R F F F
  2. R R R R F F
  3. R F R R F F
  4. R F R R R F
Section B — Short answer8 × 2 = 16 marks
9.
What does the command F mean for a grid robot, and what do L and R mean?
10.
A robot is on a 5 × 5 grid. Cells are named (column, row), with (1, 1) at the bottom left. It starts at (4, 1) facing North. F = move forward one cell, L = turn left 90°, R = turn right 90° (turning stays in the same cell). It follows: F F F F. In which cell does it stop? Give (column, row).
11.
A robot is on a 5 × 5 grid. Cells are named (column, row), with (1, 1) at the bottom left. It starts at (5, 5) facing East. F = move forward one cell, L = turn left 90°, R = turn right 90° (turning stays in the same cell). It follows: R F L R F F. Which way is it facing at the end?
12.
⬜ ⬛ ⬜ ⬛ ⭐
⬜ ⬛ ⬜ ⬜ ⬜
⬜ ⬛ ⬜ ⬛ ⬜
⬜ ⬛ ⬜ ⬛ ⬜
⬜ 🤖 ⬜ ⬛ ⬛
The robot 🤖 moves one square at a time up, down, left or right (not diagonally), and cannot enter a black square ⬛. What is the fewest number of moves to reach the star ⭐?
13.
On a street grid you walk from corner (0, 0) to corner (3, 4), moving only right (east) or up (north), one block at a time. The corner (1, 2) is closed for repairs. How many different shortest routes are there?
14.
On a grid of streets, a delivery robot goes 8 steps West, then 2 steps South, then 1 steps East. It can only move North, South, East or West. What is the fewest number of steps to get back to the start?
15.
On a 6 × 6 grid with no walls, a robot moves one cell at a time across or up and down (never diagonally). What is the fewest number of moves from (4, 6) to (3, 4)?
16.
A child faces East and turns 90° clockwise, then 90° clockwise, then 45° anticlockwise. Which way is the child facing now?
Section C — Word problems4 × 4 = 16 marks
17.
A robot starts at (1, 1) facing North on a 5 × 5 grid. Commands: F F R F F L F. (a) Write its cell after each move. (b) Where does it stop? (c) Which way does it face?
18.
A robot is on a 5 × 5 grid. Cells are named (column, row), with (1, 1) at the bottom left. It starts at (5, 3) facing South. F = move forward one cell, L = turn left 90°, R = turn right 90° (turning stays in the same cell). It follows: R F F F F L F. (a) In which cell does it stop? Give (column, row). (b) Which way is it facing at the end?
19.
⬛ ⬛ ⬜ ⭐ ⬜
⬛ ⬜ ⬜ ⬛ ⬜
⬛ ⬜ ⬛ ⬜ ⬜
⬜ ⬜ ⬛ ⬜ ⬜
⬛ 🤖 ⬜ ⬜ ⬜
The robot 🤖 moves one square at a time up, down, left or right (not diagonally), and cannot enter a black square ⬛. What is the fewest number of moves to reach the star ⭐?
20.
(a) On a street grid you walk from corner (0, 0) to corner (3, 4), moving only right (east) or up (north), one block at a time. How many different shortest routes are there?
(b) On a grid of streets, a delivery robot goes 7 steps West, then 6 steps North, then 7 steps South, then 1 steps South, then 1 steps West. It can only move North, South, East or West. What is the fewest number of steps to get back to the start?
AmbifulWorksheets
Practice that never repeats
CBSE · Class 6 · Computational Thinking and AI

Answer key

Grids and Movement · AW-6CT-GRD-2026-V1 · For parents — fold back or tear off before handing the sheet to your child.

QAnswerWorking
1(d) East—
2(a) (4, 1)track the cell and the facing after each command; it ends facing South
3(c) South1 right and 3 left quarter-turns from North
4(a) 7count outwards from the robot, one ring of squares at a time, until the star is reached
5(b) 56write at each corner the number of ways to reach it: the corner to its left plus the corner below
6(c) 8it ends 5 West and 3 South of the start
7(c) 41 across + 3 up or down
8(c) R F R R F Ftrace each set of commands; only one ends at the goal
9F moves forward one cell in the direction it faces; L and R turn it 90° left or right without moving.—
10(4, 5)track the cell and the facing after each command; it ends facing North
11South2 right and 1 left quarter-turns from East
127count outwards from the robot, one ring of squares at a time, until the star is reached
1317write at each corner the number of ways to reach it: the corner to its left plus the corner below; the closed corner gets 0
149it ends 7 West and 2 South of the start
1531 across + 2 up or down
16South-Westnet turn = 135° clockwise from East
17(a) (1, 2), (1, 3), turn, (2, 3), (3, 3), turn, (3, 4). (b) (3, 4). (c) North.—
18(a) (1, 2); (b) Southtrack the cell and the facing after each command
196count outwards from the robot, one ring of squares at a time, until the star is reached
20(a) 35; (b) 10(a) write at each corner the number of ways to reach it: the corner to its left plus the corner below; (b) it ends 8 West and 2 South of the start