With urban development and industrial restructuring, many old industrial buildings are left unused, making the renewal of such buildings a crucial aspect of urban construction. To meet the growing need for intelligent and efficient urban construction, this study proposes a greedy algorithm that considers the update of action spaces (AP-GA) to optimise the basic work of old building renovation – the layout of rows of tiles. The algorithm is optimised using the idea of action space update and backtracking. Real testing shows that the optimisation method provides the highest optimisation rate (18.20%) for AP-GA and reduces the number of cut bricks. Although the running time is slightly longer than that of the original algorithm, the brick integrity of the layout is significantly improved. When compared with other algorithms, the optimised AP-GA has the shortest average running time of 580.1 μs, demonstrating its effectiveness in the layout of rows of bricks. This new algorithm provides a more efficient and excellent method for the renewal and renovation of old industrial buildings, broadening the research perspective in the field.