▁solved ▁by ▁Steve ▁Al per n ▁and ▁independently ▁by ▁Mik h ail ▁Zel ik in ▁only ▁for ▁the ▁very ▁simple ▁graph ▁consisting ▁of ▁a ▁single ▁loop ▁( a ▁circle ). ▁The ▁value ▁of ▁the ▁game ▁on ▁the ▁unit ▁interval ▁( a ▁graph ▁with ▁two ▁nodes ▁with ▁a ▁link ▁in - between ) ▁has ▁been ▁estimated ▁approxim atively . ▁ ▁The ▁game ▁appears ▁simple ▁but ▁is ▁quite ▁complicated . ▁The ▁obvious ▁search ▁strategy ▁of ▁starting ▁at ▁a ▁random ▁end ▁and ▁" s we eping " ▁the ▁whole ▁interval ▁as ▁fast ▁as ▁possible ▁guarante es ▁a ▁ 0 . 7 5 ▁expected ▁capture ▁time , ▁and ▁is ▁not ▁optimal . ▁By ▁util ising ▁a ▁more ▁s oph istic ated ▁mixed ▁search er ▁and ▁h ider ▁strategy , ▁one ▁can ▁reduce ▁the ▁expected ▁capture ▁time ▁by ▁about ▁ 8 . 6 %. ▁This ▁number ▁would ▁be ▁quite ▁close ▁to ▁the ▁value ▁of ▁the ▁game ▁if ▁someone ▁was ▁able ▁to ▁prove ▁the ▁optim ality ▁of ▁the ▁related ▁strategy ▁of ▁the ▁prin cess . ▁ ▁See ▁also ▁Search ▁games ▁List ▁of ▁games ▁in ▁game ▁theory ▁ ▁References ▁ ▁Category : P urs uit - e vas ion ▁Category : Non - co oper ative ▁games <0x0A> </s> ▁The ▁Battle ▁of ▁P unta ▁Gru esa ▁was ▁a ▁naval ▁action ▁that ▁took ▁place ▁on ▁May ▁ 2 1 , ▁ 1 8 7 9 , ▁during ▁the ▁War ▁of ▁the ▁Pacific ▁between ▁Chile ▁and ▁Peru . ▁This ▁may ▁be ▁label led ▁as ▁the ▁second ▁part ▁of ▁the ▁Naval ▁Battle ▁of