This paper deals with a representation of tournaments (complete directed graphs with loops) by algebras having one binary operation. The variety generated by such algebras is our main object of investigation. We focus on those varietal properties which involve questions of decidability, i.e. existence of different kinds of algorithms. It is shown that the considered variety has decidable equational theory and solvable word problem. However, its elementary theory is undecidable.