Method for television channel zapping in a system comprising more than one television data reception block capable of processing data of more than one television channel, the method comprising the steps of: • determining a current channel and awaiting a channel change request; • after a channel change updating channel transitions statistics in a channel changes register by adding a record of data identifying said transition from the current channel to a destination channel including an associated time and weekday; • generating a channel transitions graph for the current channel wherein each vertex of the graph denotes a different channel and each edge of said graph comprises a matrix M comprising time windows as rows (250-258) and weekdays as columns (411-417) wherein each cell is representative of a number of transitions from the current channel to a destination channel at the corresponding time window and weekday; • calculating a transition probability score S from the current channel to the remaining channels in a current time window (t) of current weekday based on said matrices; • determining a number f of free television data reception blocks ; • selecting f best-matching channels having the highest probability score S ; • setting the free television data reception blocks to the f best-matching channels the method being characterized in that • wherein said calculating a transition probability score S is based on a weight matrix taking into account, based on a radius parameter R being a number of cells applied vertically and horizontally from a given center cell, the current channel's cell, at the corresponding time window and weekday, as well as the cells being direct neighbors of the current channel's cell in the matrix M. • determining a current channel and awaiting a channel change request; • after a channel change updating channel transitions statistics in a channel changes register by adding a record of data identifying said transition from the current channel to a destination channel including an associated time and weekday; • generating a channel transitions graph for the current channel wherein each vertex of the graph denotes a different channel and each edge of said graph comprises a matrix M comprising time windows as rows (250-258) and weekdays as columns (411-417) wherein each cell is representative of a number of transitions from the current channel to a destination channel at the corresponding time window and weekday; • calculating a transition probability score S from the current channel to the remaining channels in a current time window (t) of current weekday based on said matrices; • determining a number f of free television data reception blocks ; • selecting f best-matching channels having the highest probability score S ; • setting the free television data reception blocks to the f best-matching channels • wherein said calculating a transition probability score S is based on a weight matrix taking into account, based on a radius parameter R being a number of cells applied vertically and horizontally from a given center cell, the current channel's cell, at the corresponding time window and weekday, as well as the cells being direct neighbors of the current channel's cell in the matrix M. <EOS>