The Task
In this challenge, your task is to write a program, which takes in no input, with as many anagrams that are quine of themselves as possible.
Your score will be the number of anagrams of your program's source code that are valid quines divided by the total number of anagrams possible, i.e. the percentage of the anagrams that are valid quines.
Standard Loopholes and rules of standard quines apply.
Note: Your program must have at least 3 characters (not 3 bytes).
Input
Each anagram (or permutation) of your program which is quine of itself (i.e. the anagrams which you are including in your score) must not take any input. If your language requires input as a necessity, then you can assume that your program will be given a String consisting of the lowercase letter A. However, you must not make any use of the input in any way.
Output
n
number of distinct anagrams of your program's source-code must be valid quines, where n
represents the number of those anagrams that you are including in your score, i.e.
Those quine-anagarams can output in any way except writing the output to a variable. Writing to file, console, screen etc. is allowed. Function return
is allowed as well.
Scoring Example
Suppose your program's source code is code
. And,
code
outputscode
.coed
outputscoed
.cdoe
outputscdoe
.cdeo
outputscdeo
.cedo
outputscedo
.ceod
outputsceod
.ocde
outputsocde
.oced
outputsoced
.odce
outputsodce
.odec
does not outputodec
or produces error.oedc
does not outputoedc
or produces error.oecd
does not outputoecd
or produces error.doce
does not outputdoce
or produces error.doec
does not outputdoec
or produces error.dcoe
does not outputdcoe
or produces error.dceo
does not outputdeco
or produces error.deco
does not outputdeco
or produces error.deoc
does not outputdeoc
or produces error.eodc
does not outputeodc
or produces error.eocd
does not outputeocd
or produces error.edoc
does not outputedoc
or produces error.edco
does not outputedco
or produces error.ecdo
does not outputecdo
or produces error.ecod
does not outputecod
or produces error.
The score of this solution will be
Winning Criterion
The solution with the highest score wins! In case of a tie, the answer with higher char-count (not byte-count) wins (hence the code-bowling)! If a tie still persists, then the solution which was posted earlier wins!