Sponsored Content
Contact Us Forum Support Area for Unregistered Users & Account Problems Believe answer to one of your questions is wrong re definition of <MOVED TO ADMIN AREA> Post 303044345 by Neo on Wednesday 19th of February 2020 11:04:47 PM
Old 02-20-2020
OBTW,

I checked the DB, and the trivial question posed by Mike has been answered 123 times so far and of those 123 times, there have been 47 wrong answers.

(123 - 47) / 123 = 61.7% CORRECT.

The overall computer trivia score for all guests (in the same "guest" group as Mike Baran) is 63.8%,

This means that this "be precise in reading" question has been answered correctly by guests in a very close correlation to all questions answered in general by all guests; and so, statistically speaking, this leads me to believe (without rigorous proof) that most trivia players read the questions carefully, since that is the nature of TRUE / FALSE questions, generally speaking.

On the other hand, I have seen in the DB where some users answer questions at various intervals, some like to answer very fast and move on to the next question, some answer more slowly. Maybe someday I will write some code to try to determine the average rate of play for players and see if there is any correlation to player scores.

I know that, for me, I was taught to read T/F exam questions at least twice. Sometimes, I think I even scan them backward, LOL.

But like in all things, we are all different. Some chess players love speed chess. Others chess players prefer to sit and think out each move (like me) carefully. I've never been a fan of rapid chess, but others love it.

Anyway, I hope this helps.

Neo
 

7 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

What wrong with the variable definition

i am using the below script and trying to move files in that directory in that pattern to archive. But it doesn;t seem to take the metacharacters. Please sugggest. Code Debug output: (1 Reply)
Discussion started by: dsravan
1 Replies

2. UNIX for Dummies Questions & Answers

can any one please answer these questions

6.nohup cmn is used to Prot execn of pgm frm aborting when hangup s/g is rxd Not hangup modem Disconn a node frm s/m Chng execn prev of pgm .wat is the o/p? Cut -d”” -f3 file1/sort -r Display 3rd col of file 1 in asc order Disp 3rd col of file 1 in desc Not ... (1 Reply)
Discussion started by: techguru
1 Replies

3. Shell Programming and Scripting

How to answer the Questions in Perl .

I need to write a script to telnet or ssh a device the execute some commands in device then copy the output in a file, I wrote the script but I faced one issue, when you execute some commands the device asked me a Question, for example : device # copy run tftp device # Source filename ? ... (3 Replies)
Discussion started by: DarkSoul
3 Replies

4. Solaris

Please give me answer for these interview questions.

As i'm going to attend my first interview day after tomorrow, What should i need to answer if the interviewer asked me about 1. Tell me about your production environment. 2. What about your team size? 3. Tell me about the most critical situation/issue you have ever faced. Can any... (10 Replies)
Discussion started by: Sesha
10 Replies

5. UNIX for Dummies Questions & Answers

Need answer for these LINUX questions URGENT!!

I am very new to LINUX and could not find answer to these questions please submit your comments and suggestions to answer these questions. Appreciate your time thank you, :) If you look at the permissions associated with a symbolic link, it has universal access. Does this lead to security... (0 Replies)
Discussion started by: linux17
0 Replies

6. UNIX for Dummies Questions & Answers

Need answer for these LINUX questions URGENT!!

I am very new to LINUX and could not find answer to these questions please submit your comments and suggestions to answer these questions. Appreciate your time thank you, :) 1. Make sure there is no filename1.txt in current directory first. Now, enter vi with "vi filename1.txt" command. vi... (4 Replies)
Discussion started by: linux17
4 Replies

7. Solaris

==please answer the following questions==

Hello :) ! i've few doubts. 1) how can we find the newly attached disk in SOLARIS ? 2) how to change port number of a service ? 3) how can we find that autofs is running in our system without using svcs and prstat commands ? 4) we know that there are several types of dns servers in... (0 Replies)
Discussion started by: vamshigvk475
0 Replies
FAIRYMAX(6)						User Contributed Perl Documentation					       FAIRYMAX(6)

NAME
fairymax - xboard-compatible chess and chess-variant engine 'Fairy-Max' SYNOPSIS
fairymax [hashSize] [iniFile] shamax [hashSize] [iniFile] maxqi [hashSize] [iniFile] DESCRIPTION
fairymax is a program that plays chess and chess variants. It uses the xboard/winboard chess-engine protocol to communicate. Apart from 'regular' chess (also known as the Mad-Queen variant), it can play Capablanca chess, gothic chess, knightmate, cylinder chess, berolina chess, superchess, makruk (Thai chess), courier chess, Seirawan Chess, Spartan chess and chess with Different Armies. Fairy-Max can be easily configured by the user to play other variants as well, by modifying the ini file. This ini file describes the rules of movement of the participating pieces and the initial board setup. Fairy-Max can also play shatranj, but in this case is not aware of the shatranj rule that a bare king loses. So it might play sub- optimally in the late end-game. A version of Fairy-Max adapted to implement the baring rule is available under the name shamax. Similarly, a version of Fairy-Max adapted to play Xiang Qi (Chinese Chess) is included in the fairymax package as well, under the name maxqi. fairymax is a derivative of the world's (once) smallest chess program (source-code wise), micro-Max. The latter measures less that 2000 characters, (about 100 code lines), and has a computer rating of around 2050 on the CCRL rating list. Although this is about 1000 rating points behind the world champion, micro-Max still makes a quite tough opponent even for club players, although it is not unbeatable. The main difference between micro-Max and Fairy-Max is that the latter loads its move-generator tables, which specify how the various pieces move, from an external file, so it can be easily adapted to incorporate un-orthodox pieces. For ease of use of the artificial- intelligence, Fairy-Max is equipped with I/O routines that allow it to run with the xboard graphical user interface. See xboard(6) for instructions about how to use fairymax through xboard. To start up quickly, you just need the command: xboard -fcp fairymax. However, XBoard might not support symbols for every unorthodox piece in board sizes different from bulky, middling and petite. It might thus be advisable to specify a board size as well, e.g. xboard -fcp shamax -boardSize middling -variant shatranj to get correct display of the elephant and general pieces in shatranj. Note that to be able to play the chess variants, you will need xboard 4.3.14 or later. Some of the variants Fairy-Max plays are only partially supported by XBoard, and can only be played whith the legality-testing function of the latter switched off. (This applies to cylinder chess, berolina chess, great shatranj, Spartan chess and chess with different armies.) For some variants even the name is unknown to XBoard, and they are all grouped under the catchall name 'fairy'. Which variant is played by Fairy-Max when XBoard is set to 'fairy', can be determined by a combobox control in the XBoard 'Engine Settings' menu dialog. Fairymax supports multi-PV mode: by specifying a non-zero multi-PV margin in the Engine-Settings dialog of XBoard, Fairy-Max will not only print the principal variation for the best move, but also for every move that approaches the score of this best move to within the set margin. (If it does not find the best move on the first try, this might lead to printing of a few extra lines below the threshold.) The fmax.ini file from which Fairy-Max by default takes the piece and game definitions is a self-documenting text file, which contains instructions for how to define new pieces and chess variants. In addition it contains an extensive list of pre-defined pieces, incuding many not occurring in any of the pre-defined variants, which the user can draw on to define his own variants. Amongst the move types supported by Fairy-Max are normal leaper and slider moves, (e.g. knight and rook), divergent moves (i.e. capture and non-capture moves can be different) hoppers (which jump over other pieces, such as the Chinese cannon or the grasshopper), lame leapers (the move of which can be blocked on squares they cannot move to, such as the Chinese horse and elephant), and any combination thereof, in every possible direction. The board width is configurable upto a width of 14 squares, and cylindrical boards (where left and right edge connect) are supported as well. OPTIONS
hashSize If the first argument to fairymax is numeric, it is taken as an indicator for the amount of memory Fairy-Max is allowed to use for its internal hash table. The default value for this argument, 22, would result in a memory usage of 48MB. Each next-higher number doubles the memory usage, each next-lower halves it. Running with less than 6MB (i.e. argument 19) is not recommended. When fairymax is running under xboard 4.3.15 the hash-table size can be set through the xboard menus, making this argument superfluous. iniFile A second or non-numeric first argument is taken as a filename. Fairy-max will use the mentioned file in stead of its default fmax.ini file to define the movement of pieces and initial setup of the variants. This makes it easier to define your own variants. SEE ALSO
xboard(6) http://www.chessvariants.org/index/msdisplay.php?itemid=MSfairy-max http://home.hccnet.nl/h.g.muller/max-src2.html http://www.open-aurec.com/wbforum/viewtopic.php?f=19&t=50387 AUTHOR
Fairy-Max was written by H.G.Muller <h.g.muller@hccnet.nl>. This manual page was generated with pod2man(1). perl v5.10.1 2010-12-08 FAIRYMAX(6)
All times are GMT -4. The time now is 06:33 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy