• Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Campbell Ritchie
  • Liutauras Vilda
  • Tim Cooke
  • Jeanne Boyarsky
  • Bear Bibeault
Sheriffs:
  • Knute Snortum
  • paul wheaton
  • Devaka Cooray
Saloon Keepers:
  • Tim Moores
  • Stephan van Hulst
  • Ron McLeod
  • Piet Souris
  • Ganesh Patekar
Bartenders:
  • Tim Holloway
  • Carey Brown
  • salvin francis

Creating a Latin square verifier

 
Greenhorn
Posts: 3
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Im trying to create a program that take user input and verify if latin square or not. Latin square requirments:  Every row contains the numbers 1 through N exactly once, in any order.
 Every column contains the numbers 1 through N exactly once, in any order.
I have just the code to ask user for numbers but not too sure how to start off verifying .. (Python).. Any help would be appreciated.. thanks



 
Marshal
Posts: 65413
248
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Welcome to the Ranch

Since the logic behind verifying a Latin square/magic square/Sudoku is independent of languages, I shall move you to a different forum.
Please start by writing down the rules for your square.
 
Abdullah Alieu
Greenhorn
Posts: 3
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Thank you.

A N  N Latin square is formally dened by the following criteria:
 Every row contains the numbers 1 through N exactly once, in any order.
 Every column contains the numbers 1 through N exactly once, in any order

Those are the only rules.
 
Abdullah Alieu
Greenhorn
Posts: 3
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator

Campbell Ritchie wrote:Welcome to the Ranch

Since the logic behind verifying a Latin square/magic square/Sudoku is independent of languages, I shall move you to a different forum.
Please start by writing down the rules for your square.



A N  N Latin square is formally dened by the following criteria:
 Every row contains the numbers 1 through N exactly once, in any order.
 Every column contains the numbers 1 through N exactly once, in any order

Thank you
 
Campbell Ritchie
Marshal
Posts: 65413
248
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
So, now describe how you think you can verify that each row N places long contains the numbers1&hellip.N without gaps. The process for columns will be similar, so we shall omit that for the time being.
 
Everybody's invited. Except this tiny ad:
Enterprise-grade Excel API for Java
https://products.aspose.com/cells/java
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!