We interviewed Jonathan Crofts from Nottingham Trent University about his research on complex networks in neuroscience. Find out more about the Biomathematics & Bioinformatics Research Group at Nottingham Trent.
Puzzle: I have a 5 × 5 grid, in which the squares can either be empty (white) or infected (black). The four ‘neighbours’ of each square are the ones directly next to it: up, down, left and right. A square will become infected if two or more of its neighbours are infected. Can you find a set of squares to colour black (‘infect’) which will eventually spread the infection to the whole grid? What’s the smallest number of squares you need to do this?
The FMSP has been superseded by the AMSP