Supercell has joined hands with Chess.com this month, and tons of new content has made its way into Clash Royale with the launch of King’s Gambit Season in September 2023. The Chess Royale game mode, accompanied by themed cosmetics, is certainly at the core of the new season, while the Chess Clash event, offering a generous 1.75 million Gold for free, has captured the attention of players.
You must solve three simple chess puzzles between September 14, 2023, and September 28, 2023, to get the free in-game currency. The first initial puzzle yields 250,000 Gold, the second puzzle is worth 500,000 Gold, and the final one offers a massive one million Gold.
This article provides solutions to each puzzle offered in the mini so you can easily win 1.75 million Gold in your account.
Clash Chess event in Clash Royale: Solutions for all chess puzzles
The exact set of puzzles in the new Clash Chess event will vary slightly. However, we have you covered. This article lists all the Clash Royale Chess Puzzles solutions, and you can follow the instructions to get the corresponding rewards.
Each puzzle is coded with opponent moves like A8B8, B7A7, and so forth, as shown in the image above. You can find the solution to the puzzles using the same.
Clash Royale Chess Puzzle Solutions for free 250,000 Gold
1) Capture the Queen in two moves (A8B8)
2) Win the game in two moves (B7A7)
3) Checkmate in two moves (C3C2)
4) Win the game in two moves (D6E5)
5) Win the Rook in two moves (F7G6)
6) Capture the Rook with a double attack (H8G8)
7) Checkmate in two moves (H8H7)
Clash Royale Chess Puzzle Solutions for free 500,000 Gold
1) Win the game in two moves (A4D7)
2) Capture the Knight in two moves (A8C7)
3) Win the game in two moves (B6A6)
4) Win the game in two moves (C4C3)
5) Checkmate in two moves (C8C7)
6) Checkmate in two moves (D8C8)
7) Checkmate in two moves (F8G8)
8) Capture the Queen in two moves (G8H7)
9) Win the game in two moves (H5G6)
10) Checkmate in two moves (H7G5)
Clash Royale Chess Puzzle Solutions for free 1,000,000 Gold
1) Win the game in two moves (E5D4)
2) Checkmate in two moves (E6F5)
3) Win the game in two moves (F7G6)
4) Win the game in two moves (G7G5)
5) Checkmate in two moves (G8E7)
Steps to get free 1.75 million Gold in Clash Royale
You can follow these instructions to receive rewards:
Step 1: Access your account and click the globe icon in the top right corner.
Step 2: Select the News section and tap the Solve Chess Puzzles for Free Gold option. A new tab will open in the web browser.
Step 3: Use the solutions provided in the article above and any puzzle on the screen. Claim the rewards to get the rewards in your account.
Given that it only takes a few minutes to get 1.75 million Gold in Clash Royale, you should not miss out on this opportunity.
More from Sportskeeda
" modalPopup.closeOnEsc = false; modalPopup.setHeader("Why did you not like this content?"); modalPopup.setContentText(modalText); modalPopup.addCancelOkButton("Submit", resetRatingAndFeedbackForm, sendRating); modalPopup.removeCloseModalIcon(); modalPopup.disableDismissPopup(); modalPopup.open(); } else { sendRating(index); } } function sendRating() { var requestPayload = { "post_id": 1669192, "rating_value": ratingValue } if (ratingValue > 3) { requestPayload.rating_feedback_type = null; requestPayload.rating_feedback = null; } else { if (!$('input[name="drone"]:checked') || !$('input[name="drone"]:checked').value) { showErrorMessage('option'); return; } if (!$(".post-rating-feedback-note textarea") || !$(".post-rating-feedback-note textarea").value) { showErrorMessage('note'); return; } var selectedOption = $('input[name="drone"]:checked').value; var feedbackNote = $(".post-rating-feedback-note textarea").value; requestPayload.rating_feedback_type = selectedOption; requestPayload.rating_feedback = feedbackNote; } pureJSAjaxPost(addratingAPI, requestPayload, onsaveRatingSuccess, onsaveRatingFail, function() {}, true); } function resetRatingAndFeedbackForm() { var activeStars = Array.from($all('.rating span.rating-star.active')); for (var i=0; i < activeStars.length; i++) { activeStars[i].classList.remove("active"); } if ($('input[name="drone"]:checked')) { $('input[name="drone"]:checked').checked = false; } var userNote = document.querySelector(".post-rating-feedback-note textarea"); userNote.value = ''; modalPopup.close(); } function onsaveRatingSuccess() { modalPopup.close(); savePostIdInUserRatedPostsCookie(); $("#post-rating-layout").classList.add("hidden"); $("#post-rating-message").classList.remove("hidden"); window.setInterval(function showMessage() { $("#post-rating-widget").classList.add("hidden"); }, 3000); } function onsaveRatingFail() { console.error('Saving post rating failed!'); modalPopup.close(); } function savePostIdInUserRatedPostsCookie() { userRatedPostIds.push(1669192); var expiryTime = new Date(); expiryTime.setMonth(expiryTime.getMonth() + 12); // Expiry after 1 year setCookie("user_rated_post_ids", JSON.stringify(userRatedPostIds), expiryTime); } function isPostRatedByUser() { var userRatedPostIds = getCookie('user_rated_post_ids'); if (userRatedPostIds) { try { userRatedPostIds = JSON.parse(userRatedPostIds); } catch (err) { console.error(err); return false; } } else { return false; } if(userRatedPostIds.indexOf(1669192) >= 0) { return true; } else { return false; } } function getRatingCountByPostId(postId) { return new Promise(function(resolve, reject) { pureJSAjaxGet( getRatingCountBaseURL + postId + '/rating/count', function(data) { try { data = JSON.parse(data); if (data.meta_value) { resolve(data.meta_value); } reject("Failed to fetch rating count for the post:" + postId); } catch (err) { reject("Failed to fetch rating count for the post:" + postId); } }, function(err) { reject("Failed to fetch rating count for the post:" + postId); }, true); }); } function showErrorMessage(messageType) { var messageContainerId = '#' + messageType + '-error'; $(messageContainerId).classList.remove('hidden'); window.setInterval(function () { $(messageContainerId).classList.add("hidden"); }, 5000); } (function() { var callFired = false; function lazyLoadPostRating() { if (callFired) return; callFired = true; if (!isPostRatedByUser()) { getRatingCountByPostId(1669192) .then(function(ratingCount) { if (ratingCount < 10) { $("#post-rating-widget").classList.remove("hidden"); } }) .catch(function(err){ console.error(err); }); } } document.addEventListener("scroll", lazyLoadPostRating, { passive: true, once: true }); document.addEventListener("mousemove", lazyLoadPostRating, { passive: true, once: true }); document.addEventListener("touchmove", lazyLoadPostRating, { passive: true, once: true }); })();ncG1vNJzZmivp6x7tLzOq6uso5WasaJ6wqikaJ2jpbyzwNJomqWZo516s7vYmqOeZZOdsrS%2FjKmss7KcmsBuv86lrK2hn6PAbrPErWSfqpWaenJ5lm5kpqGcobawuoygpqWcXZi5or%2FHZpqhnaOoeqbCxKer