A　proper　coloring　of　a　graph　G　is　acyclic　if　G　contains　no　2-colored　cycle.　A　graph　G　is　acyclically　L-list　colorable　if　for　a　given　list　assignment　L　=　{L(v):　v　a　V　(G)},　there　exists　a　proper　acyclic　coloring　phi　of　G　such　that　phi(v)　a　L(v)　for　all　v　a　V　(G).　If　G　is　acyclically　L-list　colorable　for　any　list　assignment　L　with　|L(v)|　a　parts　per　thousand　yen　k　for　all　v　a　V　(G),　then　G　is　acyclically　k-choosable.　In　this　article,　we　prove　that　every　toroidal　graph　is　acyclically　8-choosable.