It runs in polynomial time and does not require any backtracking. The idea is to set up a matrix representing the button presses a column vector representing the lights and then to use standard matrix simplification techniques to determine which buttons to press. There is a standard algorithm for solving this problem that is based on Gaussian elimination over GF(2).
No if there is no solution then I will start from 2 to 24 and follow the above process till I reach 2 or found solution.īut through this I am not getting the result ? for example light at (0,0) (1,1) (2,2) (3,3) (4,4) are ON?Ĭan any one tell me correct approach using backtracking to solve this game ? If not then I will check for 1 to 24 and so on until I reach 1 or found solution. My approach is go from 1 to 25 and check if all the lights are off or not. (Diagonal neighbours are not affected.) The game provides a puzzle: given some initial configuration where some lights are on and some are off, the goal is to switch all the lights off, preferably in Pressing one of the lights will toggle it, and the four lights adjacent to it, on and off. The game consists of a 5-by-5 grid of lights when the game starts, a set of these lights (random, or one of a set of stored puzzle patterns) are switched on. I have to design and lights out game using backtracking description is below.
0 kommentar(er)
