var fDesc=new Array();
fDesc[0] = "This program is free fast and powerful solver of bridge double dummy and preferans problems (sometimes found in an online casino). <br /> The basic features are:<br /> <br /> -full tree investigation to the end, the solver always will find the exact solution, which includes best move and number of tricks in optimal game for north/south and east/west<br /> -option of estimation of all moves. Program can estimate not only best move, but all other moves and show number of tricks for them.<br /> <br /> -one can setup not only double dummy problems, but problems with any number of cards, for example double dummy problem without very first turn<br /> -oading problems from pbn (portable bridge notation) files<br /> -loading problems from *.txt,*.dat files which were stored by deep finesse.<br /> <br /> -save problem to html file for publication on the web, or add the problem to the existing html file<br /> -save/add problem to html file with best move and/or number of tricks in optimal game<br /> -convert libraries pbn, deep finesse, bts, pts files to html<br /> -skin support";

function tShowHide(id, show)
{
	var s = document.getElementById("desc");

	if ((s.innerHTML.length<=212 || show==1) && show!=2)
	{
		s.innerHTML = fDesc[id];
		if (document.getElementById('m1'))
			document.getElementById('m1').style.display='none';
		if (document.getElementById('m2'))
			document.getElementById('m2').style.display='none';
		if (document.getElementById('more_txt'))
			document.getElementById('more_txt').style.display='inline';
	}
	else
	{
		s.innerHTML = '';
	}
}