Extended circles
Enjoying Yogi Victor van Kooten's new painting ... http://www.angela-victor.com/blogs/victor/easter-comes-eggs-are-hatching
Easter comes as eggs are hatching
angela-victor.com
Add a comment...
1
Public
Friends Association for Higher Education and World University and School ...
Add a comment...
1
Public
To Mathematics at WUaS, accessible through STEM Education - http://worlduniversity.wikia.com/wiki/STEM_Education_-_Science,_Technologies,_Engineering_and_Mathematics ? and planned in many languages.
The mathematics of Boggle logic puzzles
This picture shows a logic puzzle based on the popular word game Boggle. The object of the game is to place the fourteen letters shown at the bottom into the grid in such a way that the grid spells out each of the ten words in the list on the right. The words must be constructed from the letters of sequentially adjacent squares, where adjacent refers to squares that are horizontal, vertical or diagonal neighbours, and where squares may not be reused.
It turns out that Boggle logic puzzles have mathematically interesting aspects; for example, they are related to the subgraph isomorphism problem, which is an example of an NP-complete problem. The recent paper 10 Questions about Boggle Logic Puzzles by Jonathan Needleman (http://arxiv.org/abs/1506.04173) gives a survey of what is known and proposes a number (ten!) of related problems.
The paper starts with what seems like an easy challenge: construct a filling of a 3 by 3 Boggle grid that contains each of the words ACT, APE, ATE, COP, END and OLD. It is clear that the nine letters in the grid must be ACDELNOPT, but the puzzle is a lot harder than I thought it would be, and this is partly because there are only six words in the list.
If B is a Boggle grid that has been filled in with letters, Needleman defines the set W(B) to be the set of all words in the board B that are at least two letters long. Here, the term words refers to strings of letters that may or may not be valid English words. The paper also makes the simplifying assumption that each letter appearing in the grid should appear only once, like in the grid in the picture, although the paper also discusses how this second assumption may be removed.
Two boards B and B' are said to be equivalent if they produce the same list of words. It can be shown that if two boards are equivalent, it must be the case that they differ from each other only by mirror reflection or by rotation by a multiple of a right angle. [Precise statement for mathematicians: the group of automorphisms of the adjacency graph of the Boggle grid is dihedral of order 8.]
The formal definition of a Boggle logic puzzle is as a list of words P satisfying two conditions: (1) P is a subset of W(B) for some board B, and (2) if P is a subset of W(B') for some other board B', then B and B' are equivalent. For example, the assertion that “ACT, APE, ATE, COP, END, OLD” is a Boggle logic puzzle for n=3 is the claim that (1) there exists a 3x3 Boggle board that spells out all of these six words and (2) up to symmetry, there is no other Boggle board with this property. The puzzle in the picture has two letters already filled in. As well as making the puzzle easier, this also provides enough information to break the symmetry of the solution and give a unique answer.
Two of the main themes studied in the paper are minimal solutions and maximal non-solutions of Boggle logic puzzles. Theorem 3.1 says something about the minimal solutions of a 3x3 grid. What it proves is that a puzzle consisting only of three-letter words, on a board with no repeated letters, must contain at least six words. Recall the “ACT, APE, ATE, COP, END, OLD” puzzle from earlier, which contains six three-letter words and no repeated letters. The theorem then says that any list of only five three-letter words cannot possibly lead to a unique solution. One of the open questions in the paper concerns 3x3 grids with no repeated letters whose puzzles contain only two-letter words. It can be proved that one would need at least 11 two-letter words to achieve a unique solution, but it is not known if this bound is sharp, because the smallest known example of such a puzzle contains 12 two-letter words.
The maximal non-solutions arise from lists of words that lead to a puzzle that is as inefficiently long as possible. To see what this means, suppose that you have played a game of Boggle and produced a long list of words. Is it possible to reconstruct the board (up to symmetry) using only the words you have written down? How long does your list of words have to be before this is inevitable? Even on a 3x3 grid, the number turns out to be surprisingly large: one needs 137 distinct three-letter words (out of a possible total of 160) to guarantee that the puzzle can be reconstructed uniquely. For four-letter words, the number is 377 words (out of a possible total of 496).
Relevant links
The game Boggle was designed by Allan Turoff. It was originally manufactured by Parker Brothers, and is now manufactured by Hasbro. More information on the game is here: http://en.wikipedia.org/wiki/Boggle
Image source: http://www.aspenhouse21.com/gc/boggle_east.jpg
Details of the subgraph isomorphism problem: http://en.wikipedia.org/wiki/Subgraph_isomorphism_problem
Boggle logic puzzles are reminiscent of the game Sudoku. In 2012, Gary McGuire, Bastian Tugemann and Gilles Civario proved that the smallest possible number of clues on a standard Sudoku board that can lead to a unique solution is 17. +Richard Elwes has included this result in a recent blog post about his personal top 10 mathematical achievements of the last 5ish years. You can find this post at http://goo.gl/Nl7IwX. (I've abbreviated the URL because it is rather long.)
#mathematics #scienceeveryday #spnetwork arXiv:1506.04173
This picture shows a logic puzzle based on the popular word game Boggle. The object of the game is to place the fourteen letters shown at the bottom into the grid in such a way that the grid spells out each of the ten words in the list on the right. The words must be constructed from the letters of sequentially adjacent squares, where adjacent refers to squares that are horizontal, vertical or diagonal neighbours, and where squares may not be reused.
It turns out that Boggle logic puzzles have mathematically interesting aspects; for example, they are related to the subgraph isomorphism problem, which is an example of an NP-complete problem. The recent paper 10 Questions about Boggle Logic Puzzles by Jonathan Needleman (http://arxiv.org/abs/1506.04173) gives a survey of what is known and proposes a number (ten!) of related problems.
The paper starts with what seems like an easy challenge: construct a filling of a 3 by 3 Boggle grid that contains each of the words ACT, APE, ATE, COP, END and OLD. It is clear that the nine letters in the grid must be ACDELNOPT, but the puzzle is a lot harder than I thought it would be, and this is partly because there are only six words in the list.
If B is a Boggle grid that has been filled in with letters, Needleman defines the set W(B) to be the set of all words in the board B that are at least two letters long. Here, the term words refers to strings of letters that may or may not be valid English words. The paper also makes the simplifying assumption that each letter appearing in the grid should appear only once, like in the grid in the picture, although the paper also discusses how this second assumption may be removed.
Two boards B and B' are said to be equivalent if they produce the same list of words. It can be shown that if two boards are equivalent, it must be the case that they differ from each other only by mirror reflection or by rotation by a multiple of a right angle. [Precise statement for mathematicians: the group of automorphisms of the adjacency graph of the Boggle grid is dihedral of order 8.]
The formal definition of a Boggle logic puzzle is as a list of words P satisfying two conditions: (1) P is a subset of W(B) for some board B, and (2) if P is a subset of W(B') for some other board B', then B and B' are equivalent. For example, the assertion that “ACT, APE, ATE, COP, END, OLD” is a Boggle logic puzzle for n=3 is the claim that (1) there exists a 3x3 Boggle board that spells out all of these six words and (2) up to symmetry, there is no other Boggle board with this property. The puzzle in the picture has two letters already filled in. As well as making the puzzle easier, this also provides enough information to break the symmetry of the solution and give a unique answer.
Two of the main themes studied in the paper are minimal solutions and maximal non-solutions of Boggle logic puzzles. Theorem 3.1 says something about the minimal solutions of a 3x3 grid. What it proves is that a puzzle consisting only of three-letter words, on a board with no repeated letters, must contain at least six words. Recall the “ACT, APE, ATE, COP, END, OLD” puzzle from earlier, which contains six three-letter words and no repeated letters. The theorem then says that any list of only five three-letter words cannot possibly lead to a unique solution. One of the open questions in the paper concerns 3x3 grids with no repeated letters whose puzzles contain only two-letter words. It can be proved that one would need at least 11 two-letter words to achieve a unique solution, but it is not known if this bound is sharp, because the smallest known example of such a puzzle contains 12 two-letter words.
The maximal non-solutions arise from lists of words that lead to a puzzle that is as inefficiently long as possible. To see what this means, suppose that you have played a game of Boggle and produced a long list of words. Is it possible to reconstruct the board (up to symmetry) using only the words you have written down? How long does your list of words have to be before this is inevitable? Even on a 3x3 grid, the number turns out to be surprisingly large: one needs 137 distinct three-letter words (out of a possible total of 160) to guarantee that the puzzle can be reconstructed uniquely. For four-letter words, the number is 377 words (out of a possible total of 496).
Relevant links
The game Boggle was designed by Allan Turoff. It was originally manufactured by Parker Brothers, and is now manufactured by Hasbro. More information on the game is here: http://en.wikipedia.org/wiki/Boggle
Image source: http://www.aspenhouse21.com/gc/boggle_east.jpg
Details of the subgraph isomorphism problem: http://en.wikipedia.org/wiki/Subgraph_isomorphism_problem
Boggle logic puzzles are reminiscent of the game Sudoku. In 2012, Gary McGuire, Bastian Tugemann and Gilles Civario proved that the smallest possible number of clues on a standard Sudoku board that can lead to a unique solution is 17. +Richard Elwes has included this result in a recent blog post about his personal top 10 mathematical achievements of the last 5ish years. You can find this post at http://goo.gl/Nl7IwX. (I've abbreviated the URL because it is rather long.)
#mathematics #scienceeveryday #spnetwork arXiv:1506.04173
Add a comment...
2
Public
Clouds: Friends Association for Higher Education (FAHE) WUaS near Portland Oregon 2015 Slideshow
http://scott-macleod.blogspot.com/2015/06/clouds-friends-association-for-higher.html
http://scott-macleod.blogspot.com/2015/06/clouds-friends-association-for-higher.html
Clouds: Friends Association for Higher Education (FAHE) WUaS near Portland Oregon 2015 Slideshow
scott-macleod.blogspot.com
Add a comment...
Public
To the NEW Costa Rica World University http://worlduniversity.wikia.com/wiki/Costa_Rica with some Quaker links too? Planned also in Spanish+
http://scott-macleod.blogspot.com/2015/06/to-new-costa-rica-world-university.html
http://scott-macleod.blogspot.com/2015/06/to-new-costa-rica-world-university.html
Add a comment...
1
2
Extended circles
Great - To Music Composition wiki subject page at WUaS ... http://worlduniversity.wikia.com/wiki/Music_Composition ? Planned for many languages ...
"Mastering MuseScore" entered the top 1000 best sellers rank on Amazon and is #1 in the songwriting category. Thank you all for supporting us! http://eepurl.com/bpKblr
Add a comment...
Public
To "Nanotechnology" wiki Subject page - http://worlduniversity.wikia.com/wiki/Nanotechnology - at wiki World University and School ? Planned in many, many languages / lands ...
Add a comment...
2
Public
Jun 7, 2015
An Universal Translator?
Wikidata for Wiktionary
Looking further into the CC Wikidata future, in what ways might such CC Wiktionary database developments as you're outlining here - https://www.wikidata.org/wiki/Wikidata:Wiktionary/Development/Proposals/2015-05 - inform, or be extensible into, a CC Universal Translator, eventually in all 7,929 languages in Glottolog - http://glottolog.org/glottolog/language - for example, as well as including invented and dead languages, and even inter-species' communication, - and in voice and video eventually, and for MIT OCW-centric linguistic research, as well?
Thanks and cheers,
Scott
CC WUaS Universal Translator: http://worlduniversity.wikia.com/wiki/WUaS_Universal_Translator
http://worlduniversityandschool.org/
Wikidata for Wiktionary
Looking further into the CC Wikidata future, in what ways might such CC Wiktionary database developments as you're outlining here - https://www.wikidata.org/wiki/Wikidata:Wiktionary/Development/Proposals/2015-05 - inform, or be extensible into, a CC Universal Translator, eventually in all 7,929 languages in Glottolog - http://glottolog.org/glottolog/language - for example, as well as including invented and dead languages, and even inter-species' communication, - and in voice and video eventually, and for MIT OCW-centric linguistic research, as well?
Thanks and cheers,
Scott
CC WUaS Universal Translator: http://worlduniversity.wikia.com/wiki/WUaS_Universal_Translator
http://worlduniversityandschool.org/
Add a comment...
1
Shared privately
Jun 7, 2015
Strategic Wikidata-World University Partnership?- to help pull data from the World Bank http://scott-macleod.blogspot.com/2015/06/chesapeake-bay-osprey-wikidata-help.htm to start online CC universities' in all Nation States' languages
Strategic Wikidata-World University Partnership?- to help pull data from the World Bank http://scott-macleod.blogspot.com/2015/06/chesapeake-bay-osprey-wikidata-help.htm to start online CC universities' in all Nation States' languages
Add a comment...
1
Shared privately
Jun 7, 2015
Anti-Nuclear protest in Livermore, California
‹
›
Scrapbook Photos
7 Photos - View album
Add a comment...
Extended circles
Jun 7, 2015
Info about World University and School wiki and degrees
Add a comment...
Public
Jun 7, 2015
To Theories of Learning at WUaS -
http://www.theatlantic.com/education/archive/2015/06/why-technology-alone-wont-fix-schools/394727/ - http://worlduniversity.wikia.com/wiki/Theories_of_Learning - and "Assessment_and_Grading_at_WUaS_as_Part_of_Conversation_in_Learning" - http://worlduniversity.wikia.com/wiki/Assessment_and_Grading_at_WUaS_as_Part_of_Conversation_in_Learning - and?
http://www.theatlantic.com/education/archive/2015/06/why-technology-alone-wont-fix-schools/394727/ - http://worlduniversity.wikia.com/wiki/Theories_of_Learning - and "Assessment_and_Grading_at_WUaS_as_Part_of_Conversation_in_Learning" - http://worlduniversity.wikia.com/wiki/Assessment_and_Grading_at_WUaS_as_Part_of_Conversation_in_Learning - and?
quote: But as data from PISA show, high-scoring countries emphasize high-quality education for everyone, not just the elite. America, unfortunately, does poorly here when compared against thirty-three of the world’s wealthiest countries. We have the third-lowest school enrollment rate for fifteen-year-olds (nearly 20 percent of our kids are not in school!), and we’re ninth worst in educational disparity—scores vary particularly widely between well-off students and low-income ones. We all know that our schools are unequal. Less acknowledged is that this inequality is responsible for our lack of global competitiveness.
If educational inequality is the main issue, then no amount of digital technology will turn things around. This is perhaps the least-understood corollary of technological amplification.
If educational inequality is the main issue, then no amount of digital technology will turn things around. This is perhaps the least-understood corollary of technological amplification.
Add a comment...
Public
Jun 7, 2015
See WUaS licensing here at Admissions concerning our approach to diversity ... and the 5 degrees WUaS is planning to offer online - http://worlduniversity.wikia.com/wiki/Admissions_at_World_University_and_School#World_University_and_School_Licensing - in most countries' main languages (re diversity and online and at CC Yale OYC and CC MIT OCW in 7 languages-centric WUaS :)
"To achieve the excellence to which we aspire, we must welcome talented people from all backgrounds to Princeton, and we must enable them to flourish. To deepen our understanding of the world and prepare students for citizenship and leadership in diverse societies, we must cultivate a campus climate that encourages constructive exchange among people with differing perspectives and experiences” – President Eisgruber
Add a comment...
Public
Jun 7, 2015
Wiki-add greatest educational IT resources at the main WUaS Courses' page - http://worlduniversity.wikia.com/wiki/Courses - and elsewhere at WUaS for every age, and in EVERY LANGUAGE - http://worlduniversity.wikia.com/wiki/Languages ...
Add a comment...
1
*
...
Posts
No comments:
Post a Comment