Can you see in these photos which football player we are looking for?

“); counter++; }); // When user enters tip $(“.imgguesser”).on(‘keyup’, function (e) { if (e.keyCode === 13) { checkTip($( this)); } }); function checkTip(field) { var tries = field.attr(“try”); if(try > 0) { var number = field.attr(“name”)-1; field.attr (“try”, try-1); $(“.try[number=””+(number+1)+””]”).html(“Remaining attempts: “+(attempts-1)); var solution = images[number]; var guess = field.val(); var state = $(“.solve[number=””+(number+1)+””]”).attr(“state”); $(solution[3]).any(function(key, name variations) { // For each player… if (check_guess(name variations, guess, field, number, solution, solution[3], state) == false) { return false; } }); // trying to survive? console.log(try); if(trying <= 1) { lost($("button[number=""+(number+1)+""]")); } } } // button click $(".tip").click(function() { var number = $(this).attr("number"); var field = $("input[name=""+number+""]"); checkTip(field); }); // button click $(".resolve").click(function() { var number = $(this).attr("number")-1; if($ ( this).attr('state')==0) { // give second image var solution = images[number]; $(".tipslist[number=""+(number+1)+""]").html('

Tip 1: ‘+images[number][1]+’

‘); $(this).attr(‘state’, 1); $(this).html(‘2. View Note’); $(“input[name=””+(number+1)+””]”).focus(); } else if($(this).attr(‘state’)==1) { // Show second tip $(“.tiplist[number=””+(number+1)+””]”).to add(‘

2. Hint: ‘+images[number][2]+’

‘); $(this).attr(‘state’, 2); $(“input[name=””+(number+1)+””]”).focus(); $(this).html(‘Give up’); } else { lost($(“button[number=””+(number+1)+””]”)); } }); // Function: Abandoned or exhausted attempts function lost(elm) { elm.prop(“disabled”, true); // Disable button var solution = images[elm.attr(“number”)-1]; $(“input[name=””+elm.attr(“number”)+””]”).prop(“disabled”, true); $(“input[name=””+elm.attr(“number”)+””]”).css(“border”, “2px solid #F40F97”); var guessed = $(“.guess-“+elm.attr(“number”)).length; $(“

Searched for: “+solution[3][0]+”

“).insertAfter(elm[1]); game_finished(); } // FUNCTION: check guess function check_guess(value, guess, field, number, solution, name_variations, state) { var default_name = name_variations[0]; // we take the first one as default // exceptions like (levenshtein(guess.toLowerCase(),value.toLowerCase()) <= 1) { // Richtig geraten field.val(""); // Guess aus dem Array löschen images[number][3] = images[number][3].filter(e => e !== name variations); $(“

“+default name+”

“).insertAfter(field); // Distribute points and adjust tips (if necessary) if(state==0) { // Free guess: 3 points wonpoints += 3; } else if(state==1) { / / With image tip wonpoints += 2; } else { // With text tip wonpoints += 1; } // If all guesses are correct: field.prop(“disabled”, true); field.css(“border” ,” 2px solid #7bd400″); var button = $(“button[number=””+(number+1)+””]”); button.prop(“disabled”, true); $(button.prop[1].night(“

Perfect!

“); $(“.try[number=””+(number+1)+””]”).hide(); game_finished(); return false; // Break each loop } else { field.css(“border”, “2px solid #F40F97″); field.val(”); return true ; } } // FUNCTION: Check if game is over function game_finished() { var done = true; $(“.imgguesser”).each(function() { if ($(this).prop(‘disabled’ ) == false) { finished = false; return; } }); if (done) { var totalplayers = 0; totalplayers = images.length*3; var ranking = [
/******** HIERHIN RANKING KOPIEREN ********/

[‘6′,41,’Sehr gut!’],
[‘5,5’,37,”],
[‘5’,27,”],
[‘4,5’,22,”],
[‘4’,17,”],
[‘3,5’,12,”],
[‘2′,6,’Ups’ala’],
[‘1′,0,’Hoppla, da haben wir wohl eine Wissenslücke entdeckt …’]

/******** END RANK ********/ ]; var array text = “”; $(rank).any(function(k,v) { if(points won >= v[1]) { ranking text = “Your grade is “+v[0]+”. You have “+points won+” on a total of “+totalplayers+” possible points achieved. “+v[2]; return false; } }) $(“#outputtext”).html(“

Your result

“+arrangement text+”

“); } } // FUNCTION: Check for matches between two strings function levenshtein(str1, str2) { var m = str1.length, n = str2.length, d = [],i,j; if (!m) returns n; if (!n) returns m; for (i = 0; i <= m; i++) d[i] = [i]; for (j = 0; j <= n; j++) d[0][j] = j; for (j = 1; j <= n; j++) { for (i = 1; i <= m; i++) { if (str1[i - 1] ===str2[j - 1]) {ie[i][j] = ie[i - 1][j - 1]; } else {ie[i][j] = Math.min(ie[i - 1][j]i.e[i][j - 1]i.e[i - 1][j - 1]) + 1; } } } return d[m][n]; } });