Skip to content
geeksforgeeks
  • Tutorials
    • Python
    • Java
    • Data Structures & Algorithms
    • ML & Data Science
    • Interview Corner
    • Programming Languages
    • Web Development
    • CS Subjects
    • DevOps And Linux
    • School Learning
    • Practice Coding Problems
  • Courses
    • DSA to Development
    • Get IBM Certification
    • Newly Launched!
      • Master Django Framework
      • Become AWS Certified
    • For Working Professionals
      • Interview 101: DSA & System Design
      • Data Science Training Program
      • JAVA Backend Development (Live)
      • DevOps Engineering (LIVE)
      • Data Structures & Algorithms in Python
    • For Students
      • Placement Preparation Course
      • Data Science (Live)
      • Data Structure & Algorithm-Self Paced (C++/JAVA)
      • Master Competitive Programming (Live)
      • Full Stack Development with React & Node JS (Live)
    • Full Stack Development
    • Data Science Program
    • All Courses
  • Quantitiative Aptitude
  • Logical Reasoning
  • Verbal Ability
  • Aptitude Quiz
  • Quantitiative Aptitude Quiz
  • Verbal Ability Quiz
  • Aptitude For Placements
  • Interview Corner
  • Practice Sets
Open In App
Next Article:
Puzzle 79 | Magical Matrix
Next article icon

Puzzle 79 | Magical Matrix

Last Updated : 18 Jan, 2023
Comments
Improve
Suggest changes
Like Article
Like
Report
Two friends Satyam and Ankit decides to play a game. They have 9 cards lying face up with numbers 1 to 9 written on them. They have to start picking up these cards alternately, without replacement. The person with exactly 3 cards which adds up to 15 wins the game. Satyam is given first chance to pick up a card . Does Satyam have a winning strategy? Solution: No Explanation: We see that there are eight subsets of {1,9} that sums up to 15. These are: {1, 5, 9}, {2, 8, 5}, {3, 5, 7}, {4, 5, 6}, {1, 6, 8}, {2, 4, 9}, {2, 7, 6} and {3, 8, 4} We can try to form a magic square which should be able to derive all possible combinations that sums up to 15. 8 1 6 3 5 7 4 9 2 Here we see each row , column or diagonals sums up to 15. These rows ,columns and diagonals represents all the possible ways the number fifteen can be arrived at. We can observe it's like playing a tic-tac-toe on the magic square. We also know one cannot guarantee winning in this game. At maximum, we can have strategy of not losing the game. This puzzle is contributed by Ankur Chaudhary.

Next Article
Puzzle 79 | Magical Matrix

K

kartik
Improve
Article Tags :
  • Aptitude
  • Arrangement Puzzles

Similar Reads

    Puzzle 84 | Inverted Matrix
    You have been given the following matrix: Fill in the matrix, in such a way that the sum of the numbers in each row (horizontally, vertically, and diagonally) is 264, even if you hold the matrix upside down. You are only allowed to use the digits 1, 6, 8, and 9, and each number may appear only once
    1 min read
    Coxeter method to construct the magic square
    Given an odd integer N, the task is to find the magic square of order N. Examples: Input: N = 3 Output: 6 1 8 7 5 3 2 9 4Input: N = 5 Output: 15 8 1 24 17 16 14 7 5 23 22 20 13 6 4 3 21 19 12 10 9 2 25 18 11 Approach Put the value 1 in the middle of the first row. Let the position be (i, j). Now mov
    8 min read
    Magic Squares: Fun Fact and More
    Magic squares are intriguing numerical forms that have always drawn the keen interest of mathematicians as well as problem-solvers of all age groups. They are interesting mathematical sequences of figures that have the property that the sum of the figures in any row and any column as well as the sum
    8 min read
    Magic Square | Even Order
    A magic square of order n is an arrangement of n^2 numbers, usually distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant. A magic square contains the integers from 1 to n^2.The constant sum in every row, column and diagonal is
    13 min read
    Magical Pattern
    Given an integer N as input, the task is to print the Magical Pattern as given below: N . . 3 2 1 2 3 . . N . . . . . . . . . . . 3 3 3 3 2 1 2 3 3 3 3 2 2 2 2 2 1 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 1 2 2 2 2 2 3 3 3 3 2 1 2 3 3 3 3 . . . . . . . . . . . N . . 3 2 1 2 3 . . N Examples: Input:
    9 min read
geeksforgeeks-footer-logo
Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)
Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305
GFG App on Play Store GFG App on App Store
Advertise with us
  • Company
  • About Us
  • Legal
  • Privacy Policy
  • In Media
  • Contact Us
  • Advertise with us
  • GFG Corporate Solution
  • Placement Training Program
  • Languages
  • Python
  • Java
  • C++
  • PHP
  • GoLang
  • SQL
  • R Language
  • Android Tutorial
  • Tutorials Archive
  • DSA
  • Data Structures
  • Algorithms
  • DSA for Beginners
  • Basic DSA Problems
  • DSA Roadmap
  • Top 100 DSA Interview Problems
  • DSA Roadmap by Sandeep Jain
  • All Cheat Sheets
  • Data Science & ML
  • Data Science With Python
  • Data Science For Beginner
  • Machine Learning
  • ML Maths
  • Data Visualisation
  • Pandas
  • NumPy
  • NLP
  • Deep Learning
  • Web Technologies
  • HTML
  • CSS
  • JavaScript
  • TypeScript
  • ReactJS
  • NextJS
  • Bootstrap
  • Web Design
  • Python Tutorial
  • Python Programming Examples
  • Python Projects
  • Python Tkinter
  • Python Web Scraping
  • OpenCV Tutorial
  • Python Interview Question
  • Django
  • Computer Science
  • Operating Systems
  • Computer Network
  • Database Management System
  • Software Engineering
  • Digital Logic Design
  • Engineering Maths
  • Software Development
  • Software Testing
  • DevOps
  • Git
  • Linux
  • AWS
  • Docker
  • Kubernetes
  • Azure
  • GCP
  • DevOps Roadmap
  • System Design
  • High Level Design
  • Low Level Design
  • UML Diagrams
  • Interview Guide
  • Design Patterns
  • OOAD
  • System Design Bootcamp
  • Interview Questions
  • Inteview Preparation
  • Competitive Programming
  • Top DS or Algo for CP
  • Company-Wise Recruitment Process
  • Company-Wise Preparation
  • Aptitude Preparation
  • Puzzles
  • School Subjects
  • Mathematics
  • Physics
  • Chemistry
  • Biology
  • Social Science
  • English Grammar
  • Commerce
  • World GK
  • GeeksforGeeks Videos
  • DSA
  • Python
  • Java
  • C++
  • Web Development
  • Data Science
  • CS Subjects
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox
Improvement
Suggest Changes
Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.
geeksforgeeks-suggest-icon
Create Improvement
Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.
geeksforgeeks-improvement-icon
Suggest Changes
min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences
Admission Experiences
Career Journeys
Work Experiences
Campus Experiences
Competitive Exam Experiences