you wander explorer space 2050 ConferenceThe explorer space view undirected weight grid graph size ntime m the set vertex j1le ile n 1le jle m two vertex i_1j_1 i_2 j_2 connect edge i_1i_2j_1j_21at step walk vertex connect edge current vertex on edge number exhibit since know exhibit edge contain x exhibit boredness increase xFor start vertex j answer follow question what minimum possible boredness walk j exactly k stepsYou use edge multiple time boredness edge count multiple time at step stay current vertex you change direction go edge before go start vertex j k step visit j freely