function confirmModerate(url,num,pid){ url = url + '?Comments[do]=mod&Comments[pid]=' + pid + '&Comments[id]=' + num + '#Comments_' + num; if (confirm('Do you want to report this comment as inappropriate?')) location.href=url; return 0; } function validate_form(frm) { var value = ''; var errFlag = new Array(); _qfMsg = ''; value = frm.elements['Comments[name]'].value; if (value == '' && !errFlag['name']) { errFlag['name'] = true; _qfMsg = _qfMsg + '\n - Please enter your name'; } value = frm.elements['Comments[captcha]'].value; if (value == '' && !errFlag['captcha']) { errFlag['captcha'] = true; _qfMsg = _qfMsg + '\n - Please enter Security Code'; } value = frm.elements['Comments[mail]'].value; if (value == '' && !errFlag['mail']) { errFlag['mail'] = true; _qfMsg = _qfMsg + '\n - Please enter your e-mail'; } var regex = /^((\"[^\"\f\n\r\t\v\b]+\")|([\w\!\#\$\%\&'\*\+\-\~\/\^\`\|\{\}]+(\.[\w\!\#\$\%\&'\*\+\-\~\/\^\`\|\{\}]+)*))@((\[(((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9])))\])|(((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9]))\.((25[0-5])|(2[0-4][0-9])|([0-1]?[0-9]?[0-9])))|((([A-Za-z0-9\-])+\.)+[A-Za-z\-]+))$/; if (value != '' &&!regex.test(value) && !errFlag['mail']) { errFlag['mail'] = true; _qfMsg = _qfMsg + '\n - E-mail address format is invalid'; } value = frm.elements['Comments[text]'].value; if (value == '' && !errFlag['text']) { errFlag['text'] = true; _qfMsg = _qfMsg + '\n - Please enter your comment'; } if (value.length<50 && !errFlag['text']) { errFlag['text'] = true; _qfMsg = _qfMsg + '\n - Comment is too short (50 characters min.)'; } if (value.length>4000 && !errFlag['text']) { errFlag['text'] = true; _qfMsg = _qfMsg + '\n - Comment is too long (4000 characters max)'; } if (_qfMsg != '') { _qfMsg = 'Invalid information entered:' + _qfMsg + '\nPlease correct these fields.'; alert(_qfMsg); return false; } return true; } //]]>

Monopoly revisited

Article Abstract:

By relying on the theory of Markov's chain, a complex computer-assisted analysis of Monopoly can determine the true probabilities and fairness of the game. Observations about various strategies for buying properties and placing buildings on them in order to maximize income are also offered.

Author: Stewart, Ian

Publisher: Scientific American, Inc.
Publication Name: Scientific American
Subject: Science and technology
ISSN: 0036-8733
Year: 1996

Research, Models, Usage, Mathematical analysis, Markov processes, Board games

User Contributions:

Comment about this article or add new information about this topic:

A shepherd takes a sheep shot

Article Abstract:

A mathematical proof dictates that the winning player who gets five in a row on a grid will always be the first player. The second player may force a draw in a game of nine in a row. Other logical proofs of board game combinations are presented.

Author: Stewart, Ian

Publisher: Scientific American, Inc.
Publication Name: Scientific American
Subject: Science and technology
ISSN: 0036-8733
Year: 1993

Tests, problems and exercises, Game theory, Games of chance (Mathematics)

User Contributions:

Comment about this article or add new information about this topic:

Similar abstracts:

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.